Running Time Complexity of Printing an Acyclic Automaton
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.
KeywordsSource State Regular Language Finite Automaton Preceding Destination Rational Language
Unable to display preview. Download preview PDF.
- Berstel, J. 1989. Finite Automata and Rational Languages. An Introduction, in Formal Properties of Finite Automata and Applications. In J.-E. Pin, editor, Lecture Notes in Computer Science, number 386. Verlag, 1989 edition, pages 2–14.Google Scholar
- Hopcroft, J. E, R. Motwani, and J. D Ullman. 2001. Introduction to Automata Theory, Languages and Computation. Low Price Edition. Addison Wesley Longman, Inc, Reading, Mass., USA, 2 edition.Google Scholar
- Nicaud, C. 2000. Étude du comportement en moyenne des automates finis et des languages rationnels. Thesis, University of Paris 7.Google Scholar
- Perrin, D. 1990. Finite automata. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science: Volume B: Formal Models and Semantics. Elsevier, Amsterdam, pages 1–57.Google Scholar