From NFAs to Regular Expressions by Eliminating States (The Algorithm)
Channel: Andreas Schaefer
Date: 2019-03-15

For every nondeterministic finite automaton (NFA) we can determine a regular expression defining all the words that are accepted by the automaton. One possible technique involves successively removing states from the automaton.