Automata and Computability

  title={Automata and Computability},
  author={D. Kozen},
  booktitle={Undergraduate Texts in Computer Science},
  • D. Kozen
  • Published in
    Undergraduate Texts in…
  • Mathematics, Computer Science
  • 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. 
    372 Citations
    Determinizing Alternating Tree Automata, and Models ?
    • Highly Influenced
    • PDF
    A Survey of Multi-Tape Automata
    • 13
    • PDF
    Ordered Pure Multi-Pushdown Automata
    • PDF
    Formalizing Automata
    Automatic Proof Generation in Kleene Algebra
    • 14
    • PDF
    A Constructive Theory of Regular Languages in Coq
    • 27
    • Highly Influenced
    • PDF
    Derived-Term Automata of Multitape Expressions with Composition
    • A. Demaille
    • Mathematics, Computer Science
    • Sci. Ann. Comput. Sci.
    • 2017
    • 2
    • PDF
    The Foundations of Computability Theory
    • B. Robic
    • Mathematics, Computer Science
    • Springer Berlin Heidelberg
    • 2015
    • 9
    • PDF


    The syntax and semantics of the proposed international algebraic language of the Zurich ACM-GAMM Conference
    • 392
    • PDF
    Zum Hilbertschen Aufbau der reellen Zahlen
    • 309
    • 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
    Equational Axioms for Regular Sets
    • 64
    The Lambda Calculua
    • North-Holland, Amsterdam
    • 1984
    Closure algorithms and the star-height problem of regular languages
    • 33