General algorithms for testing the ambiguity of finite automata

Cyril Allauzen; Mehryar Mohri; Ashish Rastogi

doi:10.1007/978-3-540-85780-8_8

General algorithms for testing the ambiguity of finite automata

Cyril Allauzen, Mehryar Mohri, Ashish Rastogi

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

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|_E², and finite or polynomial ambiguity in time O(|A|_E³, 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|_E³ 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.

Original language	English (US)
Title of host publication	Developments in Language Theory - 12th International Conference, DLT 2008, Proceedings
Pages	108-120
Number of pages	13
DOIs	https://doi.org/10.1007/978-3-540-85780-8_8
State	Published - 2008
Event	12th International Conference on Developments in Language Theory, DLT 2008 - Kyoto, Japan Duration: Sep 16 2008 → Sep 19 2008

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5257 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	12th International Conference on Developments in Language Theory, DLT 2008
Country/Territory	Japan
City	Kyoto
Period	9/16/08 → 9/19/08

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

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

Cite this

Allauzen, C., Mohri, M., & Rastogi, A. (2008). General algorithms for testing the ambiguity of finite automata. In Developments in Language Theory - 12th International Conference, DLT 2008, Proceedings (pp. 108-120). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5257 LNCS). https://doi.org/10.1007/978-3-540-85780-8_8

General algorithms for testing the ambiguity of finite automata. / Allauzen, Cyril; Mohri, Mehryar; Rastogi, Ashish.
Developments in Language Theory - 12th International Conference, DLT 2008, Proceedings. 2008. p. 108-120 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5257 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Allauzen, C, Mohri, M & Rastogi, A 2008, General algorithms for testing the ambiguity of finite automata. in Developments in Language Theory - 12th International Conference, DLT 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5257 LNCS, pp. 108-120, 12th International Conference on Developments in Language Theory, DLT 2008, Kyoto, Japan, 9/16/08. https://doi.org/10.1007/978-3-540-85780-8_8

Allauzen C, Mohri M, Rastogi A. General algorithms for testing the ambiguity of finite automata. In Developments in Language Theory - 12th International Conference, DLT 2008, Proceedings. 2008. p. 108-120. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-85780-8_8

@inproceedings{17117a6ba91b47a78507752bb17dc135,

title = "General algorithms for testing the ambiguity of finite automata",

abstract = "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.",

author = "Cyril Allauzen and Mehryar Mohri and Ashish Rastogi",

year = "2008",

doi = "10.1007/978-3-540-85780-8_8",

language = "English (US)",

isbn = "3540857796",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "108--120",

booktitle = "Developments in Language Theory - 12th International Conference, DLT 2008, Proceedings",

note = "12th International Conference on Developments in Language Theory, DLT 2008 ; Conference date: 16-09-2008 Through 19-09-2008",

}

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 -

General algorithms for testing the ambiguity of finite automata

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this