This book is an introduction to the theory of computation. After a chapter presenting the mathematical tools that will be used, the book examines models of computation and the associated languages, from the most elementary to the most general: finite automata and regular languages; context-free languages and pushdown automata; and Turing machines and recursively enumerable and recursive languages. There is a chapter on decision problems, reductions, and undecidability, one on the Kleene approach to computability, and a final one that introduces complexity and NP-completeness.
File Size: 3.29 MB
Format: Pdf
Download Introduction to Languages and the Theory of Computation by John C. Martin 4th Edition:
No comments :
Post a Comment