Abstract:
The paper is concerned with experiments in recognizing the state of a finite automaton with certain constraints on the set of input sequences and on distinguishability of input sequences. The constraints are chosen so as to make the experiments reproducible in dead beat discrete units.