Published on 09 May 2011 | over 6 years ago
This video shows you how to convert a simple regular expression to a finite-state automaton (FSA). Finite-state automatons are also called finite-state machines.
In a later video, I will show you how to convert a regular expression to a deterministic finite-state automaton (DFA) using an algorithm the way a computer might do it.
Report video function is under development.