TY - GEN

T1 - General algorithms for testing the ambiguity of finite automata

AU - Allauzen, Cyril

AU - Mohri, Mehryar

AU - Rastogi, Ashish

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=54249107645&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=54249107645&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-85780-8_8

DO - 10.1007/978-3-540-85780-8_8

M3 - Conference contribution

AN - SCOPUS:54249107645

SN - 3540857796

SN - 9783540857792

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 108

EP - 120

BT - Developments in Language Theory - 12th International Conference, DLT 2008, Proceedings

T2 - 12th International Conference on Developments in Language Theory, DLT 2008

Y2 - 16 September 2008 through 19 September 2008

ER -