This is the data structure that underlies ReGex. The whole point of a finite automaton, is that it is a computational model that is made of a finite number of states. It does not have memory apart from the state that its in. That being said, the entire purpose of state is a memory element.
Why ReGex can’t parse HTML
HTML is nested, if you have arbitrarily deep nesting, then you need an arbitrarily large automaton which is not finite.
Variants
- Deterministic Finite Automaton
- Non-deterministic Finite Automaton Translation
- Finite Automaton Translations
Challenges