On Characteristic Sets and of Finite Automata

Keisuke Tanatsugu, Setsuo Arikawa · 1977

The characteristic sets and degrees of finite automata are notions used by Biermann for his finite automaton learner. Some fundamental properties and relations of these notions are considered. A necessary and sufficient condition under which his learner converges to an expected automaton is given.

Read the paper · More papers on PaperTik