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.

• Type: Conference
• Year: 2004
• Where: CPM
• Authors: Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi
• Keywords: Compact Automata, CPM 2004, Directed Acyclic Word Graph, Lighter Automaton