Skeleton automata | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2011. № 2(12).

A skeleton automaton is an automaton in whichthe relation of mutual accessibility of states is the identity relation. We prove that automatathat admit a regular enumeration of states are exactly skeleton automata. It is shown howfor a given automaton one can construct an automaton with minimal number of states thathas the same subautomata lattice, and is necessarily a skeleton automaton. A procedure isproposed to obtain a skeleton automaton from a given automaton by removal of minimalnumber of arcs in its transition diagram.