Computability, Complexity, and Languages is an introductory text that 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. - 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.

Computability, Complexity, and Languages

Publisher

Elsevier

ISBN

0080502466

Language

en

Release

1994-03-18

Pages

609

Categories

Mathematics / Discrete Mathematics

Free Shipping

About the Author

Martin Davis, Ron Sigal, Elaine J. Weyuker

Books Recomendation

Sign up to our Newsletter