NFA
Nondeterministic finite automata. Corresponds to type 3 in Chomsky hierarchy.
NFAs are equivalent to DFAs in “language recognition power”.
Read more here:
- https://opendsa-server.cs.vt.edu/OpenDSA/Books/PIFLAS21/html/NFA.html
- http://compiler.org/reason-re-nfa/src/index.html
- https://cyberzhg.github.io/toolbox/nfa2dfa
- https://cyberzhg.github.io/toolbox/regex2nfa
- https://cyberzhg.github.io/toolbox/min_dfa
- https://automatonsimulator.com/
- https://ivanzuzak.info/noam/webapps/fsm_simulator/