
Premium
Preface
1/19/2025
Introduction
1/19/2025
Overview of Theory of Computation
1/19/2025
Importance in Computer Science
1/19/2025
Finite Automata
1/19/2025
Basics of Finite Automata
1/19/2025
Deterministic Finite Automata (DFA)
1/19/2025
Nondeterministic Finite Automata (NFA)
1/19/2025
Regular Languages
1/19/2025
Regular Expressions
1/19/2025
Regular Grammar
1/19/2025
Pumping Lemma for Regular Languages
1/19/2025
Context-Free Grammars
1/19/2025
Basics of Context-Free Grammars
1/19/2025
Chomsky Hierarchy
1/19/2025
Pushdown Automata
1/19/2025
Turing Machines
1/19/2025
Introduction to Turing Machines
1/19/2025
Turing Machine Formalism
1/19/2025
Turing Machine Variants
1/19/2025
Halting Problem
1/19/2025
Undecidability and Intractability
1/19/2025
Decidability and Recognizability
1/19/2025
Formal Languages and Automata
1/19/2025
Properties of Regular and Context-Free Languages
1/19/2025
Decision Properties
1/19/2025
Advanced Topics
1/19/2025
Computability Theory
1/19/2025
Complexity Theory
1/19/2025
Conclusion
1/19/2025
Appendix
1/19/2025
Useful Formulas
1/19/2025
Additional Resources
1/19/2025