Finite automata for testing uniqueness of Eulerian trails
<|reference_start|>Finite automata for testing uniqueness of Eulerian trails: 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.<|reference_end|>
@article{li2005finite,
    title={Finite automata for testing uniqueness of Eulerian trails},
    author={Qiang Li, Hui-Min Xie},
    journal={J. Comput. System Sci., 2008. 74(5): 870-874},
    year={2005},
    doi={10.1016/j.jcss.2007.10.004},
    archivePrefix={arXiv},
    eprint={cs/0507052},
    primaryClass={cs.CC cs.LO}
}