Home About Help Privacy Previous Next
Q = {1,2,3,4,5,6,7,8}
Σ = {1,2}
s0 = {1}
F = {8}
δ = {(1,1,2),(1,1,4),(2,2,2),(2,2,3),(3,1,3),(3,ε,8),(4,1,5),(4,2,6),(5,1,5),(5,2,5),(6,1,4),(6,1,6),(6,2,7),(7,ε,8)}
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