Publications
Authors:
  • Franck Guingne , Andre Kempe , Florent Nicart
Citation:
CIAA, Santa Barbara, CA, USA, July 16-18,2003. Volume 2759 of Lecture Notes in Computer Science,
Springer Verlag, pages 131-140.
Abstract:
We are going to analyse the worst-case running time complexity of traversing and printing all paths of an
acyclic automaton with a single initial and a single final state. The number of arcs and states are given, the
structure is unknown.
Year:
2003
Report number:
2003/038