Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Automata Theory: inside a RegExp machine
Formal grammars and Finite automata
RegExp history (5:08)
Regular grammars (9:31)
Finite automata (9:07)
RegExp NFA fragments
Character and Epsilon NFA (7:08)
Concatenation pattern: AB (6:41)
Union pattern: A|B (6:52)
Kleene closure: A* (6:03)
Complex machines (4:32)
Syntactic sugar (3:29)
NFA optimizations (4:47)
RegExp machine
NFA acceptor (5:17)
NFA table (8:16)
RegExp-Tree tool (4:52)
DFA table (9:44)
DFA minimization (10:58)
RegExp match (5:22)
Character and Epsilon NFA
NFA
Single character fragment
Epsilon fragment
Complete and Continue