Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Luis Balcázar, J., Díaz, J., Gabarró, J. (1995). Basic Notions About Models of Computation. In: Structural Complexity I. Texts in Theoretical Computer Science An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-79235-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-79235-9_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-79237-3
Online ISBN: 978-3-642-79235-9
eBook Packages: Springer Book Archive