Computability, complexity, and languages : fundamentals of theoretical computer science

＜図書＞
Computability, complexity, and languages : fundamentals of theoretical computer science

責任表示	Martin D. Davis, Elaine J. Weyuker
シリーズ	Computer science and applied mathematics
データ種別	図書
出版情報	Orlando, Fla. : Academic Press , 1983
本文言語	英語
大きさ	xix, 425 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 続きを見る

一般注記	Bibliography: p. 417-418 Includes index
著者標目	*Davis, Martin, 1928- Weyuker, Elaine J
件　名	LCSH:Machine theory LCSH:Computational complexity LCSH:Formal languages
分　類	LCC:QA267 DC19:001.64/01
書誌ID	1000914080
ISBN	0122063805
NCID	BA01483071
巻冊次	ISBN:0122063805
登録日	2009.09.16
更新日	2009.09.17