Problem solving in automata, languages, and complexity

著者

• Du, Dingzhu
• Ko, Ker-I

書誌事項

Problem solving in automata, languages, and complexity

Ding-Zhu Du, Ker-I Ko

John Wiley & Sons, c2001

注記

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

• NII書誌ID(NCID): BA55014755
• ISBN:
  • 0471439606
• 出版国コード: us
• タイトル言語コード: eng
• 本文言語コード: eng
• 出版地: New York
• ページ数/冊数: viii, 396 p.
• 大きさ: 25 cm
• 分類:
  • LCC : QA267
  • DC21 : 511.3
• 件名:
  • LCSH : Machine theory
  • LCSH : Formal languages
  • LCSH : Computational complexity