Introduction to automata theory, languages, and computation

著者

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

書誌事項

Introduction to automata theory, languages, and computation

John E. Hopcroft, Jeffrey D. Ullman

（Addison-Wesley series in computer science）

Addison-Wesley, c1979

注記

Bibliography: p. 396-410

Includes index

内容説明・目次

内容説明

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.

目次

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.

「Nielsen BookData」 より

詳細情報

• NII書誌ID(NCID): BA00013210
• ISBN:
  • 020102988X
• LCCN: 78067950
• 出版国コード: us
• タイトル言語コード: eng
• 本文言語コード: eng
• 出版地: Reading, Mass.
• ページ数/冊数: x, 418 p.
• 大きさ: 25 cm
• 分類:
  • LCC : QA267
  • DC : 629.8/312
• 件名:
  • LCSH : Machine theory
  • LCSH : Formal languages
  • LCSH : Computational complexity
• 親書誌ID:
  • BA00040213