Minimization algorithms for sequential transducers

Research output: Contribution to journalArticle

Abstract

We present general algorithms for minimizing sequential finite-state transducers that output strings or numbers. The algorithms are shown to be efficient since in the case of acyclic transducers and for output strings they operate in O(S + |E| + |V| + (|E| - |V| + |F|) · (|Pmax| + 1)) steps, where S is the sum of the lengths of all output labels of the resulting transducer, E the set of transitions of the given transducer, V the set of its states, F the set of final states, and Pmax one of the longest of the longest common prefixes of the output paths leaving each state of the transducer. The algorithms apply to a larger class of transducers which includes subsequential transducers.

Original languageEnglish (US)
Pages (from-to)177-201
Number of pages25
JournalTheoretical Computer Science
Volume234
Issue number1-2
StatePublished - Mar 6 2000

Fingerprint

Transducer
Transducers
Output
Strings
Prefix
Labels
Path

Keywords

  • Finite automata
  • Finite-state transducers
  • Rational power series
  • Semiring
  • Shortest-paths algorithms

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Minimization algorithms for sequential transducers. / Mohri, Mehryar.

In: Theoretical Computer Science, Vol. 234, No. 1-2, 06.03.2000, p. 177-201.

Research output: Contribution to journalArticle

@article{26dd14b8aaff4cf89e08fed9782d9a6f,
title = "Minimization algorithms for sequential transducers",
abstract = "We present general algorithms for minimizing sequential finite-state transducers that output strings or numbers. The algorithms are shown to be efficient since in the case of acyclic transducers and for output strings they operate in O(S + |E| + |V| + (|E| - |V| + |F|) · (|Pmax| + 1)) steps, where S is the sum of the lengths of all output labels of the resulting transducer, E the set of transitions of the given transducer, V the set of its states, F the set of final states, and Pmax one of the longest of the longest common prefixes of the output paths leaving each state of the transducer. The algorithms apply to a larger class of transducers which includes subsequential transducers.",
keywords = "Finite automata, Finite-state transducers, Rational power series, Semiring, Shortest-paths algorithms",
author = "Mehryar Mohri",
year = "2000",
month = "3",
day = "6",
language = "English (US)",
volume = "234",
pages = "177--201",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1-2",

}

TY - JOUR

T1 - Minimization algorithms for sequential transducers

AU - Mohri, Mehryar

PY - 2000/3/6

Y1 - 2000/3/6

N2 - We present general algorithms for minimizing sequential finite-state transducers that output strings or numbers. The algorithms are shown to be efficient since in the case of acyclic transducers and for output strings they operate in O(S + |E| + |V| + (|E| - |V| + |F|) · (|Pmax| + 1)) steps, where S is the sum of the lengths of all output labels of the resulting transducer, E the set of transitions of the given transducer, V the set of its states, F the set of final states, and Pmax one of the longest of the longest common prefixes of the output paths leaving each state of the transducer. The algorithms apply to a larger class of transducers which includes subsequential transducers.

AB - We present general algorithms for minimizing sequential finite-state transducers that output strings or numbers. The algorithms are shown to be efficient since in the case of acyclic transducers and for output strings they operate in O(S + |E| + |V| + (|E| - |V| + |F|) · (|Pmax| + 1)) steps, where S is the sum of the lengths of all output labels of the resulting transducer, E the set of transitions of the given transducer, V the set of its states, F the set of final states, and Pmax one of the longest of the longest common prefixes of the output paths leaving each state of the transducer. The algorithms apply to a larger class of transducers which includes subsequential transducers.

KW - Finite automata

KW - Finite-state transducers

KW - Rational power series

KW - Semiring

KW - Shortest-paths algorithms

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

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

M3 - Article

VL - 234

SP - 177

EP - 201

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-2

ER -