Reduction Techniques for Acyclic Cover Transducers

Authors:
Jean-Marc Champarnaud;Jacques Farré;Franck Guingne
Affiliations:
(Correspd.) Laboratoire LITIS, Université de Rouen, France. jean-marc.champarnaud@univ-rouen.fr;Laboratoire I3S, Université de Nice - Sophia Antipolis & CNRS, France. Jacques.Farre@unice.fr;Laboratoire I3S, Université de Nice - Sophia Antipolis & CNRS, France. Franck.Guingne@i3s.unice.fr
Venue:
Fundamenta Informaticae
Year:
2011

Citing 10
Cited 0

Three partition refinement algorithms

SIAM Journal on Computing
A time complexity gap for two-way probabilistic finite-state automata

SIAM Journal on Computing
Minimization algorithms for sequential transducers

Theoretical Computer Science
Minimal cover-automata for finite languages

Theoretical Computer Science
Data Structures and Algorithms

Data Structures and Algorithms
Minimizing subsequential transducers: a survey

Theoretical Computer Science
Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata

ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages

CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Minimal Cover-Automata for Finite Languages

WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Reducing acyclic cover transducers

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

Finite languages and finite subsequential functions can be represented by possibly cyclic finite machines, respectively called cover automata and cover transducers. Reduced cover machines can have fewer states than the corresponding minimal machines, yielding a compact representation for lexicons or dictionaries. We present here a new algorithm for reducing the number of states of an acyclic transducer.