Minimal Automata
Andrei Kelarev · 2003
Let £ : X —► {+ , - } and / : X —► V any mappings, and let T be a subset of V. The two-sided automaton Atmt(D) = Atmt(D ,T) = Atm*(jD, T, f ,£) (DAI) the set of states V U {1}; (DA2) the initial state 1; (DA3) the set of terminal states T; (DA4) the next-state function given, for a state u and a letter x E X , by the rule If a vertex v € V does not belong to f ( X ), then this state is inac cessible in Atmt(Z>, T), and so without loss of generality we may assume that all vertices are images of letters of the alphabet X.