Programming-Based Formal Languages and Automata Theory [E-Book] : Design, Implement, Validate, and Prove / by Marco T. Morazán.
This textbook introduces formal languages and automata theory for upper-level undergraduate or beginning graduate students. While it contains the traditional mathematical development usually employed in computational theory courses, it is also quite different from many of them. Machines, grammars, a...
Saved in:
Full text |
|
Personal Name(s): | Morazán, Marco T., author |
Edition: |
1st edition 2024. |
Imprint: |
Cham :
Springer,
2024
|
Physical Description: |
XXIII, 524 pages 163 illustrations, 38 illustrations in color (online resource) |
Note: |
englisch |
ISBN: |
9783031439735 |
DOI: |
10.1007/978-3-031-43973-5 |
Series Title: |
/* Depending on the record driver, $field may either be an array with
"name" and "number" keys or a flat string containing only the series
name. We should account for both cases to maximize compatibility. */?>
Texts in Computer Science
|
Subject (LOC): |
- Part I: Fundamental Concepts
- 1. Introduction to FSM
- 2. Essential Background
- 3. Types of Proofs
- Part II: Regular Languages
- 4. Regular Expressions
- 5. Deterministic Finite-State Machines
- 6. Nondeterministic Finite State Machines
- 7. Finite-State Automatons and Regular Expressions
- 8. Regular Grammars
- 9. Languages that are not Regular
- Part III: Context-Free Languages
- 10. Context-Free Grammars
- 11. Pushdown Automata
- 12. Equivalence of pdas and cfgs
- 13. Properties of Context-Free Languages
- 14. Deterministic PDAs
- Part IV: Context-Sensitive Languages
- 15. Turing Machines
- 16. Turing Machine Composition
- 17. Turing Machine Extensions
- 18. Context-Sensitive Grammars
- 19. Church-Turing Thesis and Undecidability
- 20. Complexity
- Part V: Epilogue
- 21. Where to Go From Here.