CL - 13d - Black holes and DFA
From Haoran Peng
We begin with a short discussion of the history and some applications of FSM. We then introduce Deterministic Finit-state Automata (DFA), and the use of the black hole convention when presenting DFA.
In this video we use lists to represent the sets used in the mathematical definition. In the code for tutorials we use the same ideas, but using Haskell's Data.Set library to represent these sets.