The halting problem. They are intended for computer science students; more specifically, their goal is to introduce the notions of computability and decidability, and to prepare for the study of automata theory, formal language theory and the theory of computing. In: Automata and Computability. Undergraduate Texts in Computer Science. Reading list. The Turing machine. D. C. Kozen, Automata and Computability, Springer Publishing Company, 1997. Church's Thesis. D. C. Kozen, Automata and Computability (Springer, Reprint of 1st Ed., 2013). S. Eilenberg, Automata, Languages, and Machines, Vol. The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. The present Lecture Notes evolved from a course given at the Technische Hogeschool Eindhoven and later at the Technische Hogeschool Twente. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. Decision problems and undecidability. A. 3 Reviews. Pushdown automata. M. Sipser, Introduction to the Theory of Computation (South-Western College Publishing, International 3rd Ed., 2012). We prove that the function of normalization in base θ, which maps any θ-representation of a real number onto its θ-development, obtained by a greedy algorithm, is a function computable by a finite automaton over any alphabet if and only if θ is a Pisot number. Springer Science & Business Media, Jun 29, 2007 - Computers - 400 pages. Literature: 1. In the remaining chapters, Turing machines are introduced and the book culminates in analyses of effective computability, decidability, and Gödel's incompleteness theorems. Cite this chapter as: Kozen D.C. (1977) Solutions to Selected Miscellaneous Exercises. Primary Texts. 2.