How abishekatp/toc_notes works
This archived repository is a collection of personal theory-of-computation notes, not an executable application. A reader starts at the index and can browse notes spanning automata and formal languages, computability, and complexity. The README documents the note files and their topics; no source excerpts are available, so relationships are limited to that documented navigation rather than inferred links between concepts.
Components 11
Automata & Languages
- DFA, NFA, Regular Languages
101_DFA_NFA_RL.md - PDA, CFG, Context-Free Languages
120_PDA_CFG_CFL.md
Computability
- Turing Machines
301_TuringMachine.md - Decidability
320_Decidability.md - Reducibility
330_Reducibility.md
Complexity
- Time Complexity
601_TimeComplexity.md - Space Complexity
630_SpaceComplexity.md - Intractability
660_Intractability.md - Advanced Topics
670_AdvancedComplexity.md
Other components
- Reader
- Notes Index
010_Index.md
Connections 10
- Reader → Notes Index: opens index
README.md - Notes Index → DFA, NFA, Regular Languages: lists link
README.md - Notes Index → PDA, CFG, Context-Free Languages: lists link
README.md - Notes Index → Turing Machines: lists link
README.md - Notes Index → Decidability: lists link
README.md - Notes Index → Reducibility: lists link
README.md - Notes Index → Time Complexity: lists link
README.md - Notes Index → Space Complexity: lists link
README.md - Notes Index → Intractability: lists link
README.md - Notes Index → Advanced Topics: lists link
README.md