Theory of computation : formal languages, automata, and complexity
著者
書誌事項
Theory of computation : formal languages, automata, and complexity
(Benjamin/Cummings series in computer science)
Benjamin/Cummings Pub. Co., c1989
大学図書館所蔵 全35件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
この図書・雑誌をさがす
注記
Bibliography: p. 317-318
Includes index
内容説明・目次
内容説明
This book presents the foundations of theoretical computer science in a format accessible to undergraduate computer science students. Designed to serve as a text for a one-semester introductory course in the theory of computation, the book covers the traditional topics of formal languages, automata, computability, and computational complexity. In his book, Glenn Brookshear encourages students to appreciate the theoretical ideas as the foundation on which real problems are solved, rather than viewing them as unuseable abstractions. Theory of Computation covers regular, context-free, and general phrase-structure languages along with their associated automata, computability in the context of Turing machines, partial recursive functions and simple programming languages, and complexity theory with an introduction to some of the open classification problems relating to the classes P and NP.
目次
Preliminaries.
Review of Set Theory.
Grammatical Basis of Language Translation.
Historical Background.
Preview of the Remaining Text.
Chapter Review Problems.
Finite Automata and Regular Languages.
Lexical Analysis.
Deterministic Finite Automata.
The Limits of Deterministic Finite Automata.
Nondeterministic Finite Automata.
Regular Grammars.
Regular Expressions.
Closing Comments.
Chapter Review Problems.
Pushdown Automata and Context-Free Languages.
Pushdown Automata.
Context-Free Grammars.
The Limits of Pushdown Automata.
LL(k) Parsers.
LR(k) Parsers.
Turing Machines and Phase-Structure Languages.
Turing Machines.
Modular Construction of Turing Machines.
Turing Machines as Language Accepters.
Turing-Acceptable Languages.
Beyond Phrase-Structure Languages.
Closing Comments.
Chapter Review Problems.
Computability.
Foundations of Recursive Function Theory.
The Scope of Primitive Recursive Functions.
Partial Recursive Functions.
The Power of Programming Languages.
Closing Comments.
Chapter Review Problems.
Complexity.
Computations.
The Complexity of Algorithms.
The Complexity of Problems.
Time Complexity of Language Recognition Problems.
Time Complexity of Nondeterministic Machines.
Closing Comments.
Chapter Review Problems.
Appendices.
A. More About Constructing LR(1) Parse Tables.
B. More About Ackerman's Function.
C. Some Important Unsolvable Problems.
D. On the Complexity of the String Comparison Problem.
E. A Sampling of NP Problems.
Additional Reading. 0805301437T04062001
「Nielsen BookData」 より