A disambiguation algorithm for finite automata and functional transducers

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We present a new disambiguation algorithm for finite automata and functional finite-state transducers. We give a full description of the algorithm, including a detailed pseudocode and analysis, and several illustrating examples. Our algorithm is often more efficient and the result dramatically smaller than the one obtained using determinization for finite automata or an existing disambiguation algorithm for transducers based on a construction of Schützenberger. 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 given 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)
Title of host publicationImplementation and Application of Automata - 17th International Conference, CIAA 2012, Proceedings
Pages265-277
Number of pages13
DOIs
StatePublished - Oct 1 2012
Event17th International Conference on Implementation and Application of Automata, CIAA 2012 - Porto, Portugal
Duration: Jul 17 2012Jul 20 2012

Publication series

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

Other

Other17th International Conference on Implementation and Application of Automata, CIAA 2012
CountryPortugal
CityPorto
Period7/17/127/20/12

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Mohri, M. (2012). A disambiguation algorithm for finite automata and functional transducers. In Implementation and Application of Automata - 17th International Conference, CIAA 2012, Proceedings (pp. 265-277). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7381 LNCS). https://doi.org/10.1007/978-3-642-31606-7_23