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...
| Κύριος συγγραφέας: | |
|---|---|
| Συγγραφή απο Οργανισμό/Αρχή: | |
| Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
| Γλώσσα: | English |
| Έκδοση: |
London :
Springer London,
2009.
|
| Σειρά: | Texts in Computer Science,
|
| Θέματα: | |
| Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- 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.