From NFAs to Regular Expressions By Solving Language Equations
Channel: Andreas Schaefer
Date: 15/03/2019

For every nondeterministic finite automaton (NFA) we can determine a regular expression defining all the words that are accepted by the automaton. An algebraic approach proceeds by solving equations using Arden's Lemma.