Transitions identification experiments with information-lossless automata

The paper addresses the problem of finite-state machine identification. To solve this problem, simple conditional experiments with automata are used. It is supposed that some automaton transitions are known. An heuristic approach is given to determine the unknown transitions.