Introduction to Automata Theory, Languages, and Computation

Front Cover
Addison-Wesley, 1979 - Computational complexity - 418 pages
10 Reviews
Preliminaries. Finite automata and regular expressions. Properties of regular sets. Context-free grammars. Pushdown automata; Properties of context-free languages. Turing machines. Undecidability. The Cohmsky hierarchy. Heterministic context-free languages. Closure properties of families of languages. Computational complexity theory. Intractable problems. Highlights of other important language classes.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.


Finite Automata and Regular Expressions
Properties of Regular Sets

13 other sections not shown

Other editions - View all

Common terms and phrases

References to this book

All Book Search results »

About the author (1979)

Ullman is the Stanford W. Ascherman Professor of Computer Science at Stanford.

Bibliographic information