Computability, Complexity, and Languages (e-bog) af Weyuker, Elaine J.
Weyuker, Elaine J. (forfatter)

Computability, Complexity, and Languages e-bog

436,85 DKK (inkl. moms 546,06 DKK)
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. Computability theory is introduced in a manner t...
E-bog 436,85 DKK
Forfattere Weyuker, Elaine J. (forfatter)
Udgivet 18 marts 1994
Længde 609 sider
Genrer PBCD
Sprog English
Format pdf
Beskyttelse LCP
ISBN 9780080502465
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. Computability theory is introduced in a manner that makes maximum use of previous programming experience, including a "e;universal"e; program that takes up less than a page. The number of exercises included has more than tripled. Automata theory, computational logic, and complexity theory are presented in a flexible manner, and can be covered in a variety of different arrangements.