1 paper
Maurice Bornett Herwig, Norbert Hundeshagen
Motivated by educational applications, we study the problem of computing all corrections that transform a finite automaton into one recognizing a given regular language L. We show…