Models of computation
In this chapter, we consider sequential models of computation where only one instruction is executed per time unit. Parallel models where several instructions are executed per time unit, will be presented later. We distinguish between general models which work on finite structures and the classical models such as the Turing machine which work on words.
KeywordsTuring Machine Computation Tree Finite Automaton Universal State Tree Automaton
Unable to display preview. Download preview PDF.