346,322 views 585 on YTPak
2,289 126

Published on 10 May 2011 | over 6 years ago

Learn to convert a nondeterministic finite state automaton (NFA) to a deterministic finite state automaton (DFA).

This is part of a series of videos about regular expressions and finite state automata as part of a course in discrete structures.
Customize Your Hybrid Embed Video Player!

6-digit hexadecimal color code without # symbol.


Report video function is under development.


Loading related videos...