Spara
Computability, Complexity, and Languages
Författare:
häftad, 1994
Engelska
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.
- Undertitel
- Fundamentals of Theoretical Computer Science
- Författare
- Martin Davis, Ron Sigal, Elaine J. Weyuker
- ISBN
- 9780122063824
- Språk
- Engelska
- Vikt
- 970 gram
- Utgivningsdatum
- 1994-03-18
- Sidor
- 609
