Reducing Acyclic Cover Transducers

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.
Mots-clés : transducteurs couverture
Type de document :
Communication dans un congrès
Implementation and Application of Automata, 12th International Conference, CIAA 2007, Prague : Tchèque, République (2007), Jul 2007, Prague, Czech Republic. 4783/2007, pp.38-50, 2007, 〈10.1007/978-3-540-76336-9〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00400754
Contributeur : Franck Guingne <>
Soumis le : mercredi 1 juillet 2009 - 16:08:27
Dernière modification le : mardi 3 octobre 2017 - 14:52:06

Identifiants

Collections

Citation

Jean-Marc Champarnaud, Franck Guingne, Jacques Farré. Reducing Acyclic Cover Transducers. Implementation and Application of Automata, 12th International Conference, CIAA 2007, Prague : Tchèque, République (2007), Jul 2007, Prague, Czech Republic. 4783/2007, pp.38-50, 2007, 〈10.1007/978-3-540-76336-9〉. 〈hal-00400754〉

Partager

Métriques

Consultations de la notice

99