An Introduction to Automata Theory, Languages, and Computation
Published on 1. January 1979
Book
Hardback
500 pages
978-0-201-02988-8 (ISBN)
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.
More details
Language
English
Place of publication
United States
Publishing group
Pearson Education (US)
Target group
College/higher education
Dimensions
Width: 242 mm
Thickness: 20 mm
Weight
682 gr
ISBN-13
978-0-201-02988-8 (9780201029888)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
New editions
John E. Hopcroft | Rajeev Motwani | Jeffrey D. Ullman
Introduction to Automata Theory, Languages, and Computation
United States Edition
Book
12/2000
2nd Edition
Pearson
€97.79
Article exhausted; check for reprint
Content
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.
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.