Ebook: Computability, complexity and languages: Fundamentals of theoretical computer science
Author: Davis M. Weyuker E.
- Series: Computer Science and Applied Mathematics
- Year: 1983
- Publisher: AP
- Language: English
- djvu
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. * 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.
Download the book Computability, complexity and languages: Fundamentals of theoretical computer science for free or read online
Continue reading on any device:
Last viewed books
Related books
{related-news}
Comments (0)