Finite automata
States, transitions, and acceptance: how a very simple abstract machine can recognize patterns, and why it is equivalent to regular expressions.
Advanced 50 min 33 viewsinformatiquethéorieautomatessupérieur
Table of contents
- 01
States, transitions, and the diagram of an automaton
- 02
Simulating an automaton and its link with regular expressions