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