Computability, Complexity, and LanguagesAuthor :
Hardback
Published : Friday 18 March 1994
Description
Covers the key areas of computer science, including recursive function theory, formal languages, and automata. This book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability. It also covers in a variety of different arrangements automata theory, computational logic, and complexity theory.
You may also like ...
by
Hardback
16 Jan 2023
Education
€93.60
Extended stock – Dispatch 5-7 days
by
Paperback
16 Jan 2023
Education
€18.72
Extended stock – Dispatch 5-7 days
by
Paperback
30 Jun 2020
Cultural studies
€45.62
Extended stock – Dispatch 5-7 days
by
Paperback
31 Mar 2020
Individual artists, art monographs
€43.28
Extended stock – Dispatch 5-7 days
Reviews