Finite automata for testing uniqueness of Eulerian trails
arXiv:cs/0507052 · doi:10.1016/j.jcss.2007.10.004
Abstract
We investigate the condition under which the Eulerian trail of a digraph is unique, and design a finite automaton to examine it. The algorithm is effective, for if the condition is violated, it will be noticed immediately without the need to trace through the whole trail.