121,134 views 328 on YTPak
933 9

Published on 09 May 2011 | over 7 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.
Customize Your Hybrid Embed Video Player!

6-digit hexadecimal color code without # symbol.


Report video function is under development.


Loading related videos...