An electronic copy of book is available for Library Members Sign in to view the book
A classical textbook on theoretical computer science, presenting formal foundations of computation including automata theory, formal languages, Turing machines, decidability, and complexity. Intended for advanced undergraduates and graduate students, the book develops rigorous mathematical theory and proofs to introduce core concepts in computability and computational complexity.
Sub Title:
Edition:
Volume:
Publisher: Computer Science Press
Publishing Year: 1989
ISBN: 978-0-7167-8182-5
Pages: 467