Regular Languages: Deterministic Finite Automaton (DFA)
6:37
Regular Languages: Nondeterministic Finite Automaton (NFA)
16:23
Deterministic Finite State Machines - Theory of Computation
17:55
Context-Free Grammars (CFG) and Context-Free Languages (CFL) - what are they?
5:11
What is the Pumping Lemma
3:25
Why study theory of computation?
18:55
A Quick Non-Deterministic to Deterministic Finite Automata Conversion
1:00:34
1. Introduction, Finite Automata, Regular Expressions
11:05