Martin, John C. author
Introduction to languages and the theory of computation John C. Martin - xii, 436 pages: illustrations ; 24 cm - McGraw-Hill series in computer science. .
Includes index.
Mathematical tools and techniques --
Finite automata and the languages they accept --
Regular expressions, nondeterminism, and Kleene's Theorem --
Context-free languages --
Pushdown automata --
Context-free and con-context-free languages --
Turing machines --
Recursively enumerable languages --
Undecidable problems --
Computable functions --
Introduction to computational complexity.
Helps students make the connection between the practice of computing and an understanding of the profound ideas that defines it. This book presents the necessary mathematical tools which provide discussion and examples that make the language intelligible.
9780071289429
Sequential machine theory
Computable functions
Mathematical logic
511.3 M363 2011
Introduction to languages and the theory of computation John C. Martin - xii, 436 pages: illustrations ; 24 cm - McGraw-Hill series in computer science. .
Includes index.
Mathematical tools and techniques --
Finite automata and the languages they accept --
Regular expressions, nondeterminism, and Kleene's Theorem --
Context-free languages --
Pushdown automata --
Context-free and con-context-free languages --
Turing machines --
Recursively enumerable languages --
Undecidable problems --
Computable functions --
Introduction to computational complexity.
Helps students make the connection between the practice of computing and an understanding of the profound ideas that defines it. This book presents the necessary mathematical tools which provide discussion and examples that make the language intelligible.
9780071289429
Sequential machine theory
Computable functions
Mathematical logic
511.3 M363 2011