Presentations of automata in locally defined classes (Q2901652)

The problem of checking experiments construction (in general case of presentations construction) is examined for an automaton-etalon in relation to the class of automata, got from an etalon by means of arcs transfers. Such class of automata, got by arcs transfers (from within some of their subsets), is defined (locally defined class). For this case sufficient and necessary conditions, at which partial automata are being presentations of the etalon, are found. The unimproved estimations of such presentations complication are got. It is shown, that the length of the shortest simple checking experiments (special case of presentation), differs from the length of the shortest graph circle path exactly on \(1\).