1 Introduction.- Overview.- What This Book Is About.- What This Book Tries to Do.- What This Book Tries Not to Do.- The Exercises.- Further Reading.- Some Advice.- 1 Languages and Machines.- 2 Elements of Formal Languages.- 3 Syntax, Semantics, and Ambiguity.- 4 Regular Languages and Finite State Recognisers.- 5 Context Free Languages and Pushdown Recognisers.- 6 Important Features of Regular and Context Free Languages.- 7 Phrase Structure Languages and Turing Machines.- 2 Machines and Computation.- 8 Finite State Transducers.- 9 Turing Machines as Computers.- 10 Turing’s Thesis and the Universality of the Turing Machine.- 11 Computability, Solvability, and the Halting Problem.- 12 Dimensions of Computation.- 3 Computation and Logic.- 13 Boolean Logic and Propositional Logic.- 14 First Order Predicate Logic.- 15 Logic and Computation.- Solutions to Selected Exercises.- 2.- 3.- 4.- 5.- 6.- 7.- 8.- 9.- 10.- 11.- 12.- 13.- 14.- 15.- Further Reading.
Springer Book Archives
From the reviews: "The book is accessible to students with limited mathematical training ! . The text is illustrated with nice pictures; there are many exercises and some of them have sketchy solutions grouped in a special section. The book also includes comments on further readings and a good index." (Cristian S. Calude, Zentralblatt MATH, Vol. 1041 (16), 2004)
 |
Ask a Question About this Product More... |
|
