Reducing Acyclic Cover Transducers - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Reducing Acyclic Cover Transducers

Résumé

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

Dates et versions

hal-00400754 , version 1 (01-07-2009)

Identifiants

Citer

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. pp.38-50, ⟨10.1007/978-3-540-76336-9⟩. ⟨hal-00400754⟩
82 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More