Properties of systems of defining relations for automata
Igor' Sergeevich Grunskii, A. S. Senchenko · Discrete Mathematics and Applications · 2004
We suggest a canonical system of defining relations for finite everywhere defined output-less automata. We construct a procedure to pass from an arbitrary finite system of defining relations to a canonical one and, as a corollary, a procedure to check whether a finite system of pairs of words is a defining system for a given automaton or not. We also suggest a procedure to pass from a traversal of all arcs of the automaton graph to a system of defining relations and vice versa.