Theory of Computation
文章平均质量分 67
williamVII
这个作者很懒,什么都没留下…
展开
-
Context-Free Languages
2.1Concepts: substitution rule (production),variable,terminal,derivationDefinition: a context-free grammar is a 4-tuple(variables, terminals, rules, start variable)Chomsky normal form: A ®B, C原创 2004-09-15 13:37:00 · 1900 阅读 · 0 评论 -
Introduction
0.1Three traditionally central areas of the theory of computation: automata, computability and complexity. 0.2Equivalence relation: reflexive,symmetric,transitiveBoolean Logic: negation, con原创 2004-09-14 14:19:00 · 917 阅读 · 0 评论 -
Regular Languages
1.1A finite automata is a 5-tuple (state, alphabet, transition function, start state, set of accept states)A language is a regular language if some finite automaton recognizes it.Regular Operati原创 2004-09-14 14:27:00 · 1757 阅读 · 0 评论 -
The Church-Turing Thesis
3.1A Turing machine is a 7-tuple(states, input alphabet, tape alphabet, transition function, start state, accept state, reject state)Call a language is Turing-recognizable if some Turing machine r原创 2004-09-15 13:40:00 · 1474 阅读 · 0 评论 -
Decidability
Theorem:A (DFA) is a decidable language (accept)Theorem: A (NFA) is a decidable language (accept)Theorem: E (DFA) is a decidable language (empty)Theorem: EQ (DFA) is a原创 2004-09-15 13:42:00 · 1246 阅读 · 0 评论