Minimization of sequential transducers

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


We present an algorithm for minimizing sequential transducers. This algorithm is shown to be efficient, since in the case of acyclic transducers it operates in O(|E| + |V| + (E | - |V| + |F|) (|Pmax| + 1) steps, where E is the set of edges of the given transducer, V the set of its vertices, F the set of final states, and Pmax the longest of the greatest common prefixes of the output paths leaving each state of the transducer. It can be applied to a larger class of transducers which includes subsequential transducers.

Original languageEnglish (US)
Title of host publicationCombinatorial Pattern Matching - 5th Annual Symposium, CPM 1994, Proceedings
EditorsMaxime Crochemore, Dan Gusfield
PublisherSpringer Verlag
Number of pages13
ISBN (Print)9783540580942
StatePublished - 1994
Event5th Annual Symposium on Combinatorial Pattern Matching, CPM 1994 - Asilomar, United States
Duration: Jun 5 1994Jun 8 1994

Publication series

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


Other5th Annual Symposium on Combinatorial Pattern Matching, CPM 1994
Country/TerritoryUnited States

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Minimization of sequential transducers'. Together they form a unique fingerprint.

Cite this