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.
€49.87
Bu e-kitabı satın alın ve 1 tane daha ÜCRETSİZ kazanın!
Dil İngilizce ● Biçim EPUB ● ISBN 9780080502465 ● Yayımcı Elsevier Science ● Yayınlanan 1994 ● İndirilebilir 6 kez ● Döviz EUR ● Kimlik 2587281 ● Kopya koruma Adobe DRM
DRM özellikli bir e-kitap okuyucu gerektirir
Aynı yazardan daha fazla e-kitap / Editör
48.586 Bu kategorideki e-kitaplar
