Computability, complexity, and languages : fundamentals of theoretical computer science / Martin D. Davis, Ron Sigal, Elaine J. Weyuker.

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...

Full description

Bibliographic Details

Online Access:	Full Text (via ScienceDirect)
Main Author:	Davis, Martin, 1928-2023
Other Authors:	Sigal, Ron, Weyuker, Elaine J.
Format:	eBook
Language:	English
Published:	Boston : Academic Press, Harcourt, Brace, 1994.
Edition:	2nd ed.
Series:	Computer science and scientific computing.
Subjects:	Machine theory. Computational complexity. Formal languages.