General algorithms for testing the ambiguity of finite automata and the double-tape ambiguity of finite-state transducers

Cyril Allauzen, Mehryar Mohri, Ashish Rastogi

Research output: Contribution to journalArticle

Abstract

We present efficient algorithms for testing the finite, polynomial, and exponential ambiguity of finite automata with ε-transitions. We give an algorithm for testing the exponential ambiguity of an automaton A in time O(|A|E 2), and finite or polynomial ambiguity in time O(|A|E 3), 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. Additionally, we give an algorithm to determine in time O(|A|E 3) the degree of polynomial ambiguity of a polynomially ambiguous automaton A and present an application of our algorithms to an approximate computation of the entropy of a probabilistic automaton. We also study the double-tape ambiguity of finite-state transducers. We show that the general problem is undecidable and that it is NP-hard for acyclic transducers. We present a specific analysis of the double-tape ambiguity of transducers with bounded delay. In particular, we give a characterization of double-tape ambiguity for synchronized transducers with zero delay that can be tested in quadratic time and give an algorithm for testing the double-tape ambiguity of transducers with bounded delay.

Original languageEnglish (US)
Pages (from-to)883-904
Number of pages22
JournalInternational Journal of Foundations of Computer Science
Volume22
Issue number4
DOIs
StatePublished - Jun 2011

Fingerprint

Finite automata
Tapes
Transducers
Testing
Polynomials
Entropy
Chemical analysis

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

General algorithms for testing the ambiguity of finite automata and the double-tape ambiguity of finite-state transducers. / Allauzen, Cyril; Mohri, Mehryar; Rastogi, Ashish.

In: International Journal of Foundations of Computer Science, Vol. 22, No. 4, 06.2011, p. 883-904.

Research output: Contribution to journalArticle

@article{99ac2884f279427380dc3bd85b6a03cd,
title = "General algorithms for testing the ambiguity of finite automata and the double-tape ambiguity of finite-state transducers",
abstract = "We present efficient algorithms for testing the finite, polynomial, and exponential ambiguity of finite automata with ε-transitions. We give an algorithm for testing the exponential ambiguity of an automaton A in time O(|A|E 2), and finite or polynomial ambiguity in time O(|A|E 3), 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. Additionally, we give an algorithm to determine in time O(|A|E 3) the degree of polynomial ambiguity of a polynomially ambiguous automaton A and present an application of our algorithms to an approximate computation of the entropy of a probabilistic automaton. We also study the double-tape ambiguity of finite-state transducers. We show that the general problem is undecidable and that it is NP-hard for acyclic transducers. We present a specific analysis of the double-tape ambiguity of transducers with bounded delay. In particular, we give a characterization of double-tape ambiguity for synchronized transducers with zero delay that can be tested in quadratic time and give an algorithm for testing the double-tape ambiguity of transducers with bounded delay.",
author = "Cyril Allauzen and Mehryar Mohri and Ashish Rastogi",
year = "2011",
month = "6",
doi = "10.1142/S0129054111008477",
language = "English (US)",
volume = "22",
pages = "883--904",
journal = "International Journal of Foundations of Computer Science",
issn = "0129-0541",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "4",

}

TY - JOUR

T1 - General algorithms for testing the ambiguity of finite automata and the double-tape ambiguity of finite-state transducers

AU - Allauzen, Cyril

AU - Mohri, Mehryar

AU - Rastogi, Ashish

PY - 2011/6

Y1 - 2011/6

N2 - We present efficient algorithms for testing the finite, polynomial, and exponential ambiguity of finite automata with ε-transitions. We give an algorithm for testing the exponential ambiguity of an automaton A in time O(|A|E 2), and finite or polynomial ambiguity in time O(|A|E 3), 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. Additionally, we give an algorithm to determine in time O(|A|E 3) the degree of polynomial ambiguity of a polynomially ambiguous automaton A and present an application of our algorithms to an approximate computation of the entropy of a probabilistic automaton. We also study the double-tape ambiguity of finite-state transducers. We show that the general problem is undecidable and that it is NP-hard for acyclic transducers. We present a specific analysis of the double-tape ambiguity of transducers with bounded delay. In particular, we give a characterization of double-tape ambiguity for synchronized transducers with zero delay that can be tested in quadratic time and give an algorithm for testing the double-tape ambiguity of transducers with bounded delay.

AB - We present efficient algorithms for testing the finite, polynomial, and exponential ambiguity of finite automata with ε-transitions. We give an algorithm for testing the exponential ambiguity of an automaton A in time O(|A|E 2), and finite or polynomial ambiguity in time O(|A|E 3), 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. Additionally, we give an algorithm to determine in time O(|A|E 3) the degree of polynomial ambiguity of a polynomially ambiguous automaton A and present an application of our algorithms to an approximate computation of the entropy of a probabilistic automaton. We also study the double-tape ambiguity of finite-state transducers. We show that the general problem is undecidable and that it is NP-hard for acyclic transducers. We present a specific analysis of the double-tape ambiguity of transducers with bounded delay. In particular, we give a characterization of double-tape ambiguity for synchronized transducers with zero delay that can be tested in quadratic time and give an algorithm for testing the double-tape ambiguity of transducers with bounded delay.

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

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

U2 - 10.1142/S0129054111008477

DO - 10.1142/S0129054111008477

M3 - Article

VL - 22

SP - 883

EP - 904

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 4

ER -