This article estimates the worst-case running time complexity for traversing and printing all successful paths of a normalized trim acyclic automaton. First, we show that the worst-case structure is a festoon with distribution of arcs on states as uniform as possible. Then, we prove that the complexity is maximum when we have a distribution of e (Napier constant) outgoing arcs per state on average, and that it can be exponential in the number of arcs. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Guingne, F., Kempe, A., & Nicart, F. (2003). Running time complexity of printing an acyclic automaton. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2759, 131–140. https://doi.org/10.1007/3-540-45089-0_13
Mendeley helps you to discover research relevant for your work.