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.
Now you can buy Books online in USA,UK, India and more than 100 countries.
*Terms and Conditions apply
Disclaimer: All product data on this page belongs to . No
guarantees are made as to accuracy of prices and information.
How to buy a book?
Search for a specific Title OR Author Or ISBN
You can search by Title of Book(Partial names allowed).
You can search by Author of Book (Partial names allowed).
You can search by Subject e.g. Physics,chemistry (Partial names allowed).
You can search by ISBN e.g. 10 digits or 13 digits ISBN or asin of Book without any spaces or hyphens.
Shipping of Books is available all over the world with few exceptions.
Buying process is 100% secure.
Create a Bookshelf of your Favorite books For Any Queries please don't hesitate to contact us at USA +1(760)3380762
India +91 9023011224
India +91 9023011224 (Whatsapp)
Buy Books online because as an Amazon Associate we earn from qualifying purchases.