Finite automata for testing uniqueness of Eulerian trails
classification
💻 cs.CC
cs.LO
keywords
conditioneulerianfinitetrailalgorithmautomataautomatondesign
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.