Reducing Acyclic Cover Transducers

DOI10.1007/978-3-540-76336-9_6zbMath1139.68359OpenAlexW2108800898MaRDI QIDQ3503893

Franck Guingne, Jacques Farré, Jean-Marc Champarnaud

Publication date: 10 June 2008

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-76336-9_6

zbMATH Keywords

finite state transducerstate reductionsubsequential transducercover transducer for a finite subsequential function

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sur une variante des fonctions séquentielles
• Minimization algorithms for sequential transducers
• Minimizing subsequential transducers: a survey.
• Computing the prefix of an automaton
• AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES
• A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
• Three Partition Refinement Algorithms
• Similarity relations and cover automata
• A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES
• COVER TRANSDUCERS FOR FUNCTIONS WITH FINITE DOMAIN
• Minimal cover-automata for finite languages

This page was built for publication: Reducing Acyclic Cover Transducers