Tyro Study
Study notes
About
Sign in
Get started
Study notes
COS2601 - Theoretical Computer Science II
COS2601 - Theoretical Computer Science II
Automata Theory
1.1
Background
1.2
Languages
1.3
Recursive Definitions
1.4
Regular Expressions
1.5
Finite Automata
1.6
Transition Graphs
1.7
Kleene's Theorem
1.8
Finite Automata with Output
1.9
Regular Languages
1.10
Nonregular Languages
1.11
Decidability
Pushdown Automata Theory
2.1
Context-Free Grammars
2.2
Grammatical Format
2.3
Pushdown Automata
2.4
CFG = PDA
2.5
Non-Context-Free Languages
2.6
Context-Free Languages
2.7
Decidability
Turing Theory
3.1
Turing Machines
3.2
Post Machines
3.3
Minsky's Theorem
3.4
Variations on the TM
3.5
TM Languages
3.6
The Chomsky Hierarchy
3.7
Computers