Fynda 4 pocket för 3 »
Spara
Computability, Complexity, and Languages
häftad, Engelska, 1994
Författare:
694 kr
Beställningsvara. Skickas inom 11-22 vardagar
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.