检验欧拉轨迹唯一性的有限自动机
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
