Introduction to automata theory, languages, and computation
Author(s)
Bibliographic Information
Introduction to automata theory, languages, and computation
（Addison-Wesley series in computer science）
Addison-Wesley, c1979
Available at / 111 libraries
-
No Libraries matched.
- Remove all filters.
Note
Bibliography: p. 396-410
Includes index
Description and Table of Contents
Description
This book presents automata theory, formal languages, and computational complexity as a coherent theory. It includes end-of-chapter questions, bibliographies, and exercises. Problems of highest and intermediate difficulty are marked respectively with double or single stars.
Table of Contents
Preliminaries.
Finite Automata and Regular Expressions.
Properties of Regular Sets.
Context-Free Grammars.
Pushdown Automata.
Properties of Context-Free Languages.
Turing Machines.
Undecideability.
The Chomsky Hierarchy.
Deterministic Context-Free Languages.
Closure Properties of Families of Languages.
Computational Complexity Theory.
Intractable Problems.
Highlights of Other Important Language Classes.
Bibliography.
Index.
by "Nielsen BookData"
