DeepRead
Cover of An introduction to formal languages and automata

An introduction to formal languages and automata

Peter Linz · 1990

Programming and computer science › Algorithms and coding interviews

#7,122 most recommended

About the book

An undergraduate-level introduction to the theory of formal languages and the abstract machines that recognize them. It covers finite automata and regular expressions, context-free grammars and pushdown automata, and Turing machines, with attention to the mathematical proofs behind each model. The book presents the main language classes as a hierarchy in which each class is matched with a grammar type and a machine type that recognize exactly that class. It develops tools for showing that a language lies outside a class, such as pumping lemmas and closure properties, and uses them to establish the limits of each model. It ends with the undecidability results for Turing machines, which mark the boundary of what computation can settle.

Written by Claude from what it knows of this book.

What Hacker News says 80% recommend · 0% critical

0242018201920202019 peak · 3
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.

  • 13 want to read
  • 3 reading
  • 1 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

The threads it came up in

Details

First published
1990
ISBN
9780669354034
Editions known
14 at Open Library
Open Library
OL3007528W

AutomatentheorieFormal languagesFormale SpracheMachine theoryProgramming languages (electronic computers)

Explore in the mosaic

Read next: its neighbours on the mosaic