On the disambiguation of finite automata and functional transducers

Research output: Contribution to journalArticle

Abstract

This paper introduces a new disambiguation algorithm for finite automata and functional finite-state transducers. It gives a full description of this algorithm, including a detailed pseudocode and analysis, and several illustrating examples. The algorithm is often more efficient and the result dramatically smaller than the one obtained using determinization for finite automata or the construction of Schützenberger. The unambiguous automaton or transducer created by our algorithm are never larger than those generated by the construction of Schützenberger. In fact, in a variety of cases, the size of the unambiguous transducer returned by our algorithm is only linear in that of the input transducer while the transducer created by the construction of Schützenberger is exponentially larger. Our algorithm can be used effectively in many applications to make automata and transducers more efficient to use.

Original languageEnglish (US)
Pages (from-to)847-862
Number of pages16
JournalInternational Journal of Foundations of Computer Science
Volume24
Issue number6
DOIs
StatePublished - Sep 2013

Fingerprint

Finite automata
Transducers

Keywords

  • determinization
  • disambiguation
  • Finite automata
  • finite-state transducers

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

On the disambiguation of finite automata and functional transducers. / Mohri, Mehryar.

In: International Journal of Foundations of Computer Science, Vol. 24, No. 6, 09.2013, p. 847-862.

Research output: Contribution to journalArticle

@article{f4183441c88f478cac16b89399c8aa9e,
title = "On the disambiguation of finite automata and functional transducers",
abstract = "This paper introduces a new disambiguation algorithm for finite automata and functional finite-state transducers. It gives a full description of this algorithm, including a detailed pseudocode and analysis, and several illustrating examples. The algorithm is often more efficient and the result dramatically smaller than the one obtained using determinization for finite automata or the construction of Sch{\"u}tzenberger. The unambiguous automaton or transducer created by our algorithm are never larger than those generated by the construction of Sch{\"u}tzenberger. In fact, in a variety of cases, the size of the unambiguous transducer returned by our algorithm is only linear in that of the input transducer while the transducer created by the construction of Sch{\"u}tzenberger is exponentially larger. Our algorithm can be used effectively in many applications to make automata and transducers more efficient to use.",
keywords = "determinization, disambiguation, Finite automata, finite-state transducers",
author = "Mehryar Mohri",
year = "2013",
month = "9",
doi = "10.1142/S0129054113400224",
language = "English (US)",
volume = "24",
pages = "847--862",
journal = "International Journal of Foundations of Computer Science",
issn = "0129-0541",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "6",

}

TY - JOUR

T1 - On the disambiguation of finite automata and functional transducers

AU - Mohri, Mehryar

PY - 2013/9

Y1 - 2013/9

N2 - This paper introduces a new disambiguation algorithm for finite automata and functional finite-state transducers. It gives a full description of this algorithm, including a detailed pseudocode and analysis, and several illustrating examples. The algorithm is often more efficient and the result dramatically smaller than the one obtained using determinization for finite automata or the construction of Schützenberger. The unambiguous automaton or transducer created by our algorithm are never larger than those generated by the construction of Schützenberger. In fact, in a variety of cases, the size of the unambiguous transducer returned by our algorithm is only linear in that of the input transducer while the transducer created by the construction of Schützenberger is exponentially larger. Our algorithm can be used effectively in many applications to make automata and transducers more efficient to use.

AB - This paper introduces a new disambiguation algorithm for finite automata and functional finite-state transducers. It gives a full description of this algorithm, including a detailed pseudocode and analysis, and several illustrating examples. The algorithm is often more efficient and the result dramatically smaller than the one obtained using determinization for finite automata or the construction of Schützenberger. The unambiguous automaton or transducer created by our algorithm are never larger than those generated by the construction of Schützenberger. In fact, in a variety of cases, the size of the unambiguous transducer returned by our algorithm is only linear in that of the input transducer while the transducer created by the construction of Schützenberger is exponentially larger. Our algorithm can be used effectively in many applications to make automata and transducers more efficient to use.

KW - determinization

KW - disambiguation

KW - Finite automata

KW - finite-state transducers

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

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

U2 - 10.1142/S0129054113400224

DO - 10.1142/S0129054113400224

M3 - Article

VL - 24

SP - 847

EP - 862

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 6

ER -