Finite automata for testing uniqueness of Eulerian trails
Computational Complexity
2008-05-20 v1 Logic in Computer Science
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.
Keywords
Cite
@article{arxiv.cs/0507052,
title = {Finite automata for testing uniqueness of Eulerian trails},
author = {Qiang Li and Hui-Min Xie},
journal= {arXiv preprint arXiv:cs/0507052},
year = {2008}
}