DeepRead
Cover of Automata, Computability and Complexity

Automata, Computability and Complexity

Elaine A. Rich · 2007

Programming and computer science › Algorithms and coding interviews

#14,985 most recommended

About the book

A university-level textbook on the theory of computation. It covers formal languages and the automata that recognise them, including finite-state machines and pushdown automata, then Turing machines and computability, and finally the classes and limits of computational complexity such as P, NP, and NP-completeness. It is written mainly for computer science students. The book's emphasis is that these abstract models are practical tools, not only theory: regular expressions, grammars, and parsers rest directly on automata and formal languages. It presents undecidability and intractability as concrete limits that people designing software must account for. It builds from simple machines toward general computation and, at each step, shows what a model can and cannot do.

Written by Claude from what it knows of this book.

What Hacker News says 50% recommend · 0% critical

02420132015202020232013 peak · 1
This bookAverage book in Algorithms and coding interviews

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 2 want to read
  • 0 reading
  • 0 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

Details

First published
2007
ISBN
9780132288064
Editions known
2 at Open Library
Open Library
OL9320259W

Computable functionsComputational complexityElectronic data processingMachine theory

Explore in the mosaic

Read next: its neighbours on the mosaic