Home About Help Privacy Previous Next
All non-deterministic finite state machines (NFA) can be converted into equivalent deterministic machines (DFA).
This can be done using subset construction, where the DFA is given a state for each reachable combination of states in the NFA.
Follow the instructions below to convert the NFA on the left.
Introducing FSMs I Introducing FSMs II Accepting states I Accepting states II Introducing cycles Machine construction I Machine construction II Using longer tokens Vending machine acceptor Nondeterministic transitions I Nondeterministic transitions II Nondeterministic Transitions III Introducing ε transitions Combining machines with ε transitions ▶ Conversion to DFA I Conversion to DFA II Conversion to DFA III Formal machine definition I Formal machine definition II Regular expressions - Kleene star I Regular expressions - Boolean or Regular expressions - Kleene star II Regular expressions - abb(abb)* Introducing minimization Introducing transducers