Course Code: COMP314825 Topics
Theory of Automata
Master key topics and exam concepts step by step. Track completed lessons, practice past papers, and access verified study notes.
25
Total Topics
0
Completed
25
Pending
1
Units / Chapters
All Topics
0/25 done25 topics
01
Finite State Models02
Language definitions preliminaries03
Regular expressions/Regular languages04
Finite automata (FAs)05
Transition graphs (TGs)06
NFAs07
Kleene's theorem08
Transducers (automata with output)09
Pumping lemma and non-regular language10
Grammars and PDA11
CFGs12
Derivations, derivation trees and ambiguity13
Simplifying CFLs14
Normal form grammars and parsing15
Decidability16
Context sensitive languages17
Grammars and linear bounded automata (LBA)18
Chomsky's hierarchy of grammars19
Turing Machines Theory20
Turing machines21
Post machine22
Variations on TM23
TM encoding24
Universal Turing Machine25
Defining Computers by TMsPast Papers
Open this section to view and download past papers
Click on Show Past Papers to load available exam papers.