Transcription of Turing Machines: An Introduction
{{id}} {{{paragraph}}}
CIT 596 theory of Computation 1. Turing Machines: An Introduction We have seen several abstract models of computing devices: Deterministic Finite automata , Nondeterministic Finite automata , Non- deterministic Finite automata with -Transitions, Pushdown automata , and Deterministic Pushdown automata . However, none of the above seem to be as powerful as a real com- puter, right? We now turn our attention to a much more powerful abstract model of a computing device: a Turing machine . This model is believed to do everything that a real computer can do. c Marcelo Siqueira Spring 2005.. CIT 596 theory of Computation 2. Turing Machines: An Introduction A Turing machine is somewhat similar to a finite automaton, but there are important differences: 1. A Turing machine can both write on the tape and read from it.
CIT 596 – Theory of Computation 1 Turing Machines: An Introduction We have seen several abstract models of computing devices: Deterministic Finite Automata, Nondeterministic Finite Automata, Non-deterministic Finite Automata with ²-Transitions, Pushdown Automata, and Deterministic Pushdown Automata.
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}