Finite automata for testing uniqueness of Eulerian trails

Details Finite automata for testing uniqueness of Eulerian trails Finite automata for testing uniqueness of Eulerian trails

2005-07-20

arxiv.org/abs/cs/0507052v1

J. Comput. System Sci., 2008. 74(5): 870-874

Computer Science

Computational Complexity

Scientific paper

10.1016/j.jcss.2007.10.004

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.

Affiliated with

Also associated with

No associations

Rating

Finite automata for testing uniqueness of Eulerian trails does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finite automata for testing uniqueness of Eulerian trails, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite automata for testing uniqueness of Eulerian trails will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-491187