Norbert Hundeshagen

Correcting Deterministic Finite Automata for Didactic Feedback

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 that for deterministic finite automata the set of all corrections can be finitely characterized as a regular tree language. The construction...