Characterizing Experiments for Finite-Memory Binary Automata

The characteristics of a discrete automaton with a finite memory can be determined by an experiment of a finite length. This paper discusses the properties of such experiments, and presents methods for their optimal construction. Specific results are given for binary-input automata with the memory ranges 0, 1, 2, 3 and 4.