This book is an introduction to theoretical computer science, covering topics such as formal languages, automata theory, computability theory, and complexity theory. It provides a comprehensive overview of the foundational concepts, including regular languages and finite automata, context-free languages and pushdown automata, Turing machines and computability, and time and space complexity classes. The book also covers important theorems and results, such as the Pumping Lemma, the Church-Turing thesis, Godel's Incompleteness Theorem, and NP-completeness. It is written in a clear and concise manner, making it accessible to students and researchers with a basic understanding of discrete mathematics and programming. This book serves as an essential guide for anyone interested in the fundamental concepts of theoretical computer science.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Da: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condizione: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Codice articolo L0-9798394110139
Quantità: Più di 20 disponibili
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
PAP. Condizione: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Codice articolo L0-9798394110139
Quantità: Più di 20 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9798394110139_new
Quantità: Più di 20 disponibili