### 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|) · (|P_{max}| + 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 P_{max} 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 language | English (US) |
---|---|

Pages (from-to) | 177-201 |

Number of pages | 25 |

Journal | Theoretical Computer Science |

Volume | 234 |

Issue number | 1-2 |

State | Published - Mar 6 2000 |

### Fingerprint

### Keywords

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

### ASJC Scopus subject areas

- Computational Theory and Mathematics

### Cite this

*Theoretical Computer Science*,

*234*(1-2), 177-201.

**Minimization algorithms for sequential transducers.** / Mohri, Mehryar.

Research output: Contribution to journal › Article

*Theoretical Computer Science*, vol. 234, no. 1-2, pp. 177-201.

}

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

AN - SCOPUS:0000116303

VL - 234

SP - 177

EP - 201

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-2

ER -