Computability, complexity, and languages
Subtitle: fundamentals of theoretical computer science
By: Martin D. Davis, Ron Sigal, Elaine J. Weyuker.
Contributors: Sigal, Ron.; Weyuker, Elaine J.
Edition: 2nd. ed.
Series: Computer science and scientific computing
Publisher: Academic Press, Harcourt, Brace
Published: 1994
Place of publication: Boston
Language: eng
Number of pages: 609
Subjects: Machine theory; Computational complexity; Formal languages
Description: This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes very little background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability.
Notes: Includes bibliographical references (p. 593-594) and index.