This paper presents efficient algorithms for testing the finite, polynomial, and exponential ambiguity of finite automata with ε-transitions. It gives an algorithm for testing the exponential ambiguity of an automaton A in time O(|A|E2, and finite or polynomial ambiguity in time O(|A|E3, where |A| E denotes the number of transitions of A. These complexities significantly improve over the previous best complexities given for the same problem. Furthermore, the algorithms presented are simple and based on a general algorithm for the composition or intersection of automata. We also give an algorithm to determine in time O(|A|E3 the degree of polynomial ambiguity of a polynomially ambiguous automaton A. Finally, we present an application of our algorithms to an approximate computation of the entropy of a probabilistic automaton. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Allauzen, C., Mohri, M., & Rastogi, A. (2008). General algorithms for testing the ambiguity of finite automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5257 LNCS, pp. 108–120). https://doi.org/10.1007/978-3-540-85780-8_8
Mendeley helps you to discover research relevant for your work.