Theory of Computation
The planned outline of 12 modules. Lessons are written, run and reviewed before they are published.
Planned outline
- Module 1
Strings, languages and the questions of computation
Coming soon - Module 2
Deterministic finite automata
Coming soon - Module 3
Nondeterminism and the subset construction
Coming soon - Module 4
Regular expressions and Kleene's theorem
Coming soon - Module 5
Limits and properties of regular languages
Coming soon - Module 6
Finite-state machines in real software
Coming soon - Module 7
Context-free grammars and parsing
Coming soon - Module 8
Pushdown automata and context-free language properties
Coming soon - Module 9
Turing machines and the Church–Turing thesis
Coming soon - Module 10
Decidability and undecidability
Coming soon - Module 11
Complexity: P, NP, PSPACE and beyond
Coming soon - Module 12
GATE CS theory of computation: method and practice
India-specific Coming soon
Related tools
Official documentation
- gate2027.iitm.ac.in/static/doc/GATE2027_Syllabus/CS_GATE2027_Syllabus.pdf (gate2027.iitm.ac.in)
- ocw.mit.edu/courses/18-404j-theory-of-computation-fall-2020 (ocw.mit.edu)
More in Computer science fundamentals
- Object-Oriented Programming (coming soon)
- Database Management Systems (coming soon)
- Operating Systems (coming soon)
- Computer Networks (coming soon)
- All CS fundamentals tracks
- How we make lessons