Reducing acyclic cover transducers

Authors:
Jean-Marc Champarnaud;Franck Guingne;Jacques Farré
Affiliations:
Laboratoire LITIS, Université de Rouen, France;Laboratoire I3S, Université de Nice-Sophia Antipolis and CNRS, France;Laboratoire I3S, Université de Nice-Sophia Antipolis and CNRS, France
Venue:
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Year:
2007

Citing 7
Cited 1

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

Reduction Techniques for Acyclic Cover Transducers

Fundamenta Informaticae

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. In general, reduced cover machines have much 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.