计算理论导论(英文版)图灵机.pptVIP

Chapter 3 The Church-Turing Thesis Models of Computing Devices Finite automata Tape head moves only in one direction Tape is read-only The length of tape is constant Pushdown automata Tape head moves only in one direction Tape is read-only, but stack is writable Tape length is constant, but stack in unbounded Stack is accessible only in FILO way Conclusion Both DFA and PDA are handicapped machines with limited computation power. They are too restricted to serve as model of general purpose computers. Considering more powerful model for computation: Writable and two way tape Random access memor