automata & python - computerphile
Sigma = {a, b}
Language = { words where as come before bs }
DFA (Deterministic Finite Automaton)
 |
|---|
| dfa image - captured from https://youtu.be/32bC33nJR3A |
0 and 1 -> good state
2 -> bad state
| Case | Result |
|---|---|
| aa | OK |
| aabbb | OK |
| ba | KO |
| aba | KO |
| ebsilon (empty) | OK |