DeepRead
Cover of Languages and machines

Languages and machines

Thomas A. Sudkamp · 1988

Programming and computer science › Lisp and Scheme

#9,180 most recommended

About the book

A textbook introduction to the theory of formal languages and automata, covering the grammars and abstract machines that define classes of languages, from finite automata through pushdown automata to Turing machines. It also treats computability and computational complexity, and is written for computer science students. As a textbook it makes no single thesis, but its organizing claim is that the language classes in the Chomsky hierarchy correspond to classes of machines of increasing power, so a language's structure can be understood through the machine that recognizes it. It develops this correspondence through closure properties, decision problems, and the limits of what machines can decide, and uses it to explain why some problems are tractable and others are not.

Written by Claude from what it knows of this book.

What Hacker News says 67% recommend · 0% critical

02.5520102015202020222010 peak · 2
This bookAverage book in Lisp and Scheme

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 72 want to read
  • 6 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
1988
ISBN
9780321315342
Editions known
8 at Open Library
Open Library
OL2985241W

511.3Automates mathématiques, théorie desComplexité de calcul (informatique)Computational complexityFormal languagesLangages formelsMachine theoryProgramming languages (electronic computers)Qa267.3 .s83 2006

Explore in the mosaic

Read next: its neighbours on the mosaic