このページのリンク

利用統計

  • このページへのアクセス:10回

  • 貸出数:1回
    (1年以内の貸出数:0回)

<図書>
Computability, complexity, and languages : fundamentals of theoretical computer science

責任表示 Martin D. Davis, Ron Sigal, Elaine J. Weyuker
シリーズ Computer science and scientific computing
データ種別 図書
2nd. ed
出版者 Boston : Academic Press
出版年 c1994
本文言語 英語
大きさ xix, 609 p. : ill. ; 24 cm
概要 This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is...divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability. Key Features * Computability theory is introduced in a manner that makes maximum use of previous programming experience, including a "universal" program that takes up less than a page * The number of exercises included has more than tripled * Automata theory, computational logic, and complexity theory are presented in a flexible manner, and can be covered in a variety of different arrangements 続きを見る

所蔵情報


中央図 自動書庫 003212001001452 007.6/D 46 1994

中央図 自動書庫 017211999012434 007.1/D 46/19991243 1994

書誌詳細

一般注記 Includes bibliographical references and index
著者標目 *Davis, Martin, 1928-
Sigal, Ron
Weyuker, Elaine J
件 名 LCSH:Machine theory
LCSH:Computational complexity
LCSH:Formal languages
分 類 LCC:QA267
DC20:511.3
書誌ID 1000049297
ISBN 0122063821
NCID BA22456871
巻冊次 ISBN:0122063821
登録日 2009.09.10
更新日 2009.09.14

類似資料