Theory of Automata Virtual University handouts
Click here to Download
Friday, May 27, 2011
An Introduction to Formal Languages and Automata by Peter Linz
An Introduction to Formal Languages and Automata by Peter Linz
This text covers all the material essential to an introductory theory of computation course for undergraduate students. The text has a solid mathematical base, and provides precise mathematical statements of theorems and definitions, giving an intuitive motivation for constructions and proofs. Proofs and arguments are clearly stated, without excessive mathematical detail, to help students understand the basic principles. The text is illustrated with integrated examples of new concepts as well as an abundance of exercises to aid in the development of problem solving skills.
Click here to download
Introduction to the theory of computation, 2nd Edition Michael Sipser
Introduction to the theory of computation,“Intended as an upper-level undergraduate or introductory graduate text in computer science theory," this book lucidly covers the key concepts and theorems of the theory of computation. The presentation is remarkably clear; for example, the "proof idea," which offers the reader an intuitive feel for how the proof was constructed, accompanies many of the theorems and a proof. Introduction to the Theory of Computation covers the usual topics for this type of text plus it features a solid section on complexity theory – including an entire chapter on space complexity. The final chapter introduces more advanced topics, such as the discussion of complexity classes associated with probabilistic algorithms.”
2nd Edition Michael Sipser
Click here to download
Subscribe to:
Posts (Atom)