Elements of Computation Theory
As Computer Science progressively matures as an established discipline, it becomes increasingly important to revisit its theoretical foundations, learn the appropriate techniques for answering theory-based questions, and build one’s confidence in implementing this knowledge when building computer ap...
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
London
Springer London
2009, 2009
|
| Edition: | 1st ed. 2009 |
| Series: | Texts in Computer Science
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer eBooks 2005- - Collection details see MPG.ReNa |
Table of Contents:
- Mathematical Preliminaries
- Regular Languages
- Equivalences
- Structure of Regular Languages
- Context-free Languages
- Structure of CFLs
- Computably Enumerable Languages
- A Noncomputably Enumerable Language
- Algorithmic Solvability
- Computational Complexity