计算理论复习教学课件.ppt

* * * * * * * * * * * * * * * * * * * * * * * * * Final Review The Chomsky Hierarchy Chapter II Transition function will determine unique late state based on current input and state. The Definition of NDA Pumping Theorem 2.4.8 Every regular language is also a context-free  language. True! For any finite automaton accepting a language L, you can easily build a pushdown automaton that also accepts L. All finite languages (i.e., languages that consist of  a finite number of words) are regular. True! For any finite language L on an alphabet {s1, …, sn} you could build a finite automaton whose structure is a complete n-ary tree with root q1, and the height of this tree equals the length of the longest word in L. All states that correspond to words in L you turn into accepting states. Chapter III Definition of Pushdown Automata Context-free grammars Definition Transform of CFG to PDA Pumping Theorem Chapter IV The Construction of Turing Machine Chapter V Chuch-Turing Thesis Universal Turing Machine Halting Problem Universal Turing Machine How do we input another TM The Halting Problem Non-Recursive Language The Language H is not recursive; H is precisely the language semi-decided by universal Turing machine U and is recursively enumerable. Therefore, the class of recursive languages is a strict subset of the class of recursively enumerable languages. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *