Theory of Automata
This subject walks you through the most important concepts step by step, starting from the foundations and moving towards practical exam-focused preparation. Use this page as your central place to revise topics, jump into notes, and quickly access practice material when you need it.
U1
General Topics
topic 1 to 25
25 topics
01
Finite State Models
02
Language definitions preliminaries
03
Regular expressions/Regular languages
04
Finite automata (FAs)
05
Transition graphs (TGs)
06
NFAs
07
Kleene's theorem
08
Transducers (automata with output)
09
Pumping lemma and non-regular language
10
Grammars and PDA
11
CFGs
12
Derivations, derivation trees and ambiguity
13
Simplifying CFLs
14
Normal form grammars and parsing
15
Decidability
16
Context sensitive languages
17
Grammars and linear bounded automata (LBA)
18
Chomsky's hierarchy of grammars
19
Turing Machines Theory
20
Turing machines
21
Post machine
22
Variations on TM
23
TM encoding
24
Universal Turing Machine
25
Defining Computers by TMs
Past Papers
Open this section to load past papers
Click on Show Past Papers to see past papers.