Spar
Computability, Complexity, and Languages
Forfatter:
heftet, 1994
Engelsk
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.
- Undertittel
- Fundamentals of Theoretical Computer Science
- Forfatter
- Martin Davis, Ron Sigal, Elaine J. Weyuker
- ISBN
- 9780122063824
- Språk
- Engelsk
- Vekt
- 970 gram
- Utgivelsesdato
- 18.3.1994
- Antall sider
- 609
