Introduction to automata theory, languages, and computation

書誌事項

Introduction to automata theory, languages, and computation

John E. Hopcroft, Jeffrey D. Ullman

(Addison-Wesley series in computer science)

Addison-Wesley, c1979

大学図書館所蔵 件 / 116

この図書・雑誌をさがす

注記

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. 020102988XB04062001

目次

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」 より

関連文献: 1件中  1-1を表示

詳細情報

ページトップへ