博客指出自动机对研究计算极限（可判定性和难解性）至关重要。介绍了自动机中重要的两种符号表示，语法对处理递归结构数据的软件设计有用，正则表达式表示数据结构。还提及两种证明方法，演绎法用合理步骤序列，归纳法是对参数化语句的递归证明。
automata are essential for the study of the limits of computation: dicidability and intractability.
2 important notations that play an important role in automata:
1), grammars are useful models when designing software that proceses data with a recursive structure. example: parser.
2), regular expressions denote the structure of data.
2 kinds of proof:
1) deducitve kind, using a sequence of justified steps
2) inductive kind, recursive proof of a parameterized statement that use the statement itself with the lower “value” of the paramter.
2 important notations that play an important role in automata:
1), grammars are useful models when designing software that proceses data with a recursive structure. example: parser.
2), regular expressions denote the structure of data.
2 kinds of proof:
1) deducitve kind, using a sequence of justified steps
2) inductive kind, recursive proof of a parameterized statement that use the statement itself with the lower “value” of the paramter.
扫一扫
131
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
