Automata and Computability
@inproceedings{Kozen1997AutomataAC,
title={Automata and Computability},
author={D. Kozen},
booktitle={Undergraduate Texts in Computer Science},
year={1997}
}From the Publisher:
This introduction to the basic theoretical models of computability develops their rich and varied structure. The first part is devoted to finite automata and their properties. Afterwards, pushdown automata are utilized as a broader class of models, enabling the analysis of context-free languages. In the remaining chapters, Turing machines are introduced, and the book culminates in discussions of effective computability, decidability, and Godel's incompleteness theorems.
Topics from this paper
Paper Mentions
372 Citations
Derived-Term Automata of Multitape Expressions with Composition
- Mathematics, Computer Science
- Sci. Ann. Comput. Sci.
- 2017
- 2
- PDF
The Foundations of Computability Theory
- Mathematics, Computer Science
- Springer Berlin Heidelberg
- 2015
- 9
- PDF
References
SHOWING 1-8 OF 8 REFERENCES
Algebra Automata I: Parallel Programming as a Prolegomena to the Categorical Approach
- Computer Science
- Inf. Control.
- 1968
- 64
The syntax and semantics of the proposed international algebraic language of the Zurich ACM-GAMM Conference
- Computer Science
- IFIP Congress
- 1959
- 392
- PDF
The Theory of Paraing
- Translation, and Compiling, Vol. I: Parsing, Prentice Hall, Englewood Clift's, NJ
- 1972
On formal properties of simple phrase structure grammars
- Z. Phonetik. Sprachwiaa. Kommunikationaforach., 14
- 1961
The Lambda Calculua
- North-Holland, Amsterdam
- 1984
Closure algorithms and the star-height problem of regular languages
- Mathematics, Computer Science
- 1976
- 33