Models of computation

  • Richard Lassaigne
  • Michel de Rougemont
Part of the Discrete Mathematics and Theoretical Computer Science book series (DISCMATH)


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.


Turing Machine Computation Tree Finite Automaton Universal State Tree Automaton 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London 2004

Authors and Affiliations

  • Richard Lassaigne
    • 1
  • Michel de Rougemont
    • 2
  1. 1.Maitre de ConferencesUniversity Paris VIIFrance
  2. 2.University Paris IIFrance

Personalised recommendations