Basic Notions About Models of Computation
The aim of this chapter is to define many concepts that the reader is assumed to know, mainly in order to fix our notation. We present here some concepts of formal languages, set theoretic operations and relations, boolean formulas, and several models of computation, such as finite automata and the different versions of Turing machines: deterministic, nondeterministic, and oracle Turing machines.
KeywordsTuring Machine Finite Automaton Boolean Formula Satisfying Assignment Input Tape
Unable to display preview. Download preview PDF.