You might also like

More about Computability, Complexity, and Languages

• Book details
• Synopsis
• Trending among others

You get 188 loyalty points

Book synopsis

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.

Book details

Book category Books in English Computing & information technology Computer science Mathematical theory of computation

• Full title: Computability, Complexity, and Languages
• Subtitle: Fundamentals of Theoretical Computer Science
• Author: Martin Davis, Ron Sigal, Elaine J. Weyuker
• Language: English
• Binding: Hardback
• Number of pages: 609
• EAN: 9780122063824
• ISBN: 0122063821
• ID: 04493274
• Publisher: Elsevier Science & Technology
• Weight: 1062 g
• Dimensions: 236 × 162 × 48 mm
• Date of publishing: 18. March 1994

Trending among others

---

---

---