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.
€50.13
यह ईबुक खरीदें और 1 और मुफ़्त पाएं!
भाषा अंग्रेज़ी ● स्वरूप EPUB ● ISBN 9780080502465 ● प्रकाशक Elsevier Science ● प्रकाशित 1994 ● डाउनलोड करने योग्य 6 बार ● मुद्रा EUR ● आईडी 2587281 ● कॉपी सुरक्षा Adobe DRM
एक DRM सक्षम ईबुक रीडर की आवश्यकता है
एक ही लेखक से अधिक ईबुक / संपादक
48,995 इस श्रेणी में ईबुक
