Introduction to automata theory, languages, and computation

Author(s)

• Hopcroft, John E.
• Ullman, Jeffrey D.

Bibliographic Information

Introduction to automata theory, languages, and computation

John E. Hopcroft, Jeffrey D. Ullman

（Addison-Wesley series in computer science）

Addison-Wesley, c1979

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"

Details

• NCID: BA00013210
• ISBN:
  • 020102988X
• LCCN: 78067950
• Country Code: us
• Title Language Code: eng
• Text Language Code: eng
• Place of Publication: Reading, Mass.
• Pages/Volumes: x, 418 p.
• Size: 25 cm
• Classification:
  • LCC : QA267
  • DC : 629.8/312
• Subject Headings:
  • LCSH : Machine theory
  • LCSH : Formal languages
  • LCSH : Computational complexity
• Parent Bibliography ID:
  • BA00040213