Module 0103: Finite state automata

Module 0103: Finite state automata

Tak Auyeung, Ph.D.

November 29, 2006

1 About this module
2 A bit of history
3 Applications of automata theory
4 DFAs
5 Vi, the editor
5.1 Example 1
5.2 Example 2
5.3 Example 3
6 Back to DFAs
6.1 Regex to DFA (work in progress)
  6.1.1 Single literal symbol
  6.1.2 Sequence
  6.1.3 Alternatives
  6.1.4 Getting rid of epsilon transitions
  6.1.5 Any number of
  6.1.6 At least one of
  6.1.7 Getting rid of “unget” transitions