Problem solving in automata, languages, and complexity
著者
書誌事項
Problem solving in automata, languages, and complexity
John Wiley & Sons, c2001
大学図書館所蔵 件 / 全14件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
"A Wiley-Interscience publication."
Includes bibliographical references (p. 387-388) and index
内容説明・目次
内容説明
Automata and natural language theory are topics lying at the heart of computer science. Both are linked to computational complexity and together, these disciplines help define the parameters of what constitutes a computer, the structure of programs, which problems are solvable by computers, and a range of other crucial aspects of the practice of computer science. In this important volume, two respected authors/editors in the field offer accessible, practice-oriented coverage of these issues with an emphasis on refining core problem solving skills.
目次
Preface.
Leverages.
Finite Automata.
Context-Free Languages.
Turing Machines.
Computability Theory.
Computational Complexity.
NP-Completeness.
References.
Index.
「Nielsen BookData」 より