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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Crochemore, Maxime, Epifanio, Chiara, Grossi, Roberto, Mignosi, Filippo
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Automata and formal languages Computer Science Computer science control theory systems Data Structures and Algorithms Exact sciences and technology factor and suffix automata index suffix tree text compression Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!