A trie-based approach for compacting automata - Archive ouverte HAL Access content directly
Conference Papers Year : 2004

A trie-based approach for compacting automata


We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression and does not need to retain the input string, differently from other methods based on compact automata. The net effect is that of obtaining a lighter automaton than the directed acyclic word graph (DAWG) of Blumer et al., as it uses less nodes, still with arcs labeled by single characters.
Fichier principal
Vignette du fichier
cpm04.pdf (179.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00619974 , version 1 (26-03-2013)



Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi. A trie-based approach for compacting automata. Combinatorial Pattern Matching, 2004, Turkey. pp.145-158, ⟨10.1007/978-3-540-27801-6_11⟩. ⟨hal-00619974⟩
108 View
322 Download



Gmail Facebook Twitter LinkedIn More