Cargando…
Computability, complexity, and languages : fundamentals of theoretical computer science /
This introductory text 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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autores principales: | , , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Boston :
Academic Press, Harcourt, Brace,
1994.
|
| Edición: | 2nd ed. |
| Colección: | Computer science and scientific computing.
|
| Temas: | |
| Acceso en línea: | Texto completo |
| Sumario: | This introductory text 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 "universal" 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. |
|---|---|
| Descripción Física: | 1 online resource (xix, 609 pages) : illustrations |
| Bibliografía: | Includes bibliographical references (pages 593-594)-and indexes. |
| ISBN: | 9780080502465 0080502466 |