Finite automata for testing uniqueness of Eulerian trails

Simple item page
dc.creatorLi, Qiang
dc.creatorXie, Hui-Min
dc.date2005-07-20
dc.date.accessioned2026-07-07T09:39:44Z
dc.date.available2026-07-07T09:39:44Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/cs/0507052
dc.identifierhttp://arxiv.org/abs/cs/0507052
dc.identifierJ. Comput. System Sci., 2008. 74(5): 870-874
dc.identifierdoi:10.1016/j.jcss.2007.10.004
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/161284
dc.subjectComputational Complexity
dc.subjectLogic in Computer Science
dc.subjectF.4.3
dc.titleFinite automata for testing uniqueness of Eulerian trails
dc.typetext

Files

Collections

arXiv