Computability, complexity, and languages

Name: Computability, complexity, and languages
Author: Davis, Martin
ISBN: 0122063821

Davis, Martin

Tvé hodnocení

Zatím nehodnoceno

Rok vydání 1994

This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes very little background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability.

Přidat do oblíbených

Přidat na polici