Computability, complexity, and languages fundamentals of theoretical computer science
Читать фрагмент
Моментальное скачивание
после оплаты (24/7)
Широкий выбор форматов
(для всех устройств)
Полная версия книги
(в т.ч. для Apple и Android)
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.
LF/222194571/R
Характеристики
- ФИО Автора
- Davis
Elaine J
Martin
Ron
Sigal
Weyuker - Язык
- Английский
- Серия
- Computer science and scientific computation
- ISBN
- 9780122063824
- Дата выхода
- 2003
![[The Great Ranger 01] • Fog...](https://lionbook.net/1022018-thickbox_default/-the-great-ranger-01-fog-lifted-an-epik-fantasy-short.jpg)
