IMPORTANT MESSAGE: We are relocating warehouses on Tuesday, 4th April. Our last orders will be dispatched on Monday, 3rd April and we will resume dispatch on Thursday, 6th April. Back-Orders and Express Orders may be delayed if ordered during this period. If you are unsure regarding your order, please send us an email on: email@example.com and we will get back to you as soon as possible
Computability, Complexity and Languages: Fundamentals of Theoretical Computer Science
Morgan Kaufmann Publishers In
2 Rev ed
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.
Out of Stock
Sorry but this item is out of stock, please check back again soon.