Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Comm. ACM 18(6), 333–340 (1975)
Béal, M.-P.: Codage Symbolique, Masson (1993)
Béal, M.-P., Mignosi, F., Restivo, A.: Minimal Forbidden Words and Symbolic Dynamics. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, Springer, Heidelberg (1996)
Blumer, A., Blumer, J., Haussler, D., Ehrenfeucht, A., Chen, M.T., Seiferas, J.: The Smallest Automaton Recognizing the Subwords of a Text. Theoretical Computer Science 40(1), 31–55 (1985)
Crochemore, M.: Reducing space for index implementation. Theoretical Computer Science 292(1), 185–197 (2003)
Crochemore, M., Mignosi, F., Restivo, A.: Automata and forbidden words. Information Processing Letters 67(3), 111–117 (1998)
Crochemore, M., Mignosi, F., Restivo, A., Salemi, S.: Data compression using antidictonaries. In: Storer, J. (ed.) Special issue Lossless data, compressionProceedings of the IEEE, vol.88 pp. 1756–1768 (2000)
Crochemore, M., Vérin, R.: Direct Construction of Compact Directed Acyclic Word Graphs. In: Hein, J., Apostolico, A. (eds.) CPM 1997. LNCS, vol.1264, pp. 116–129. Springer, Heidelberg (1997)
Diekert, V., Kobayashi, Y.: Some identities related to automata, determinants, and Möbius functions, Report 1997/05, Fakultät Informatik, Universität Stuttgart. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol.1046, pp. 555–566. Springer, Heidelberg (1996)
Durgan, B.K.: Compact searchable static binary trees. Information Processing Letters 89, 49–52 (2004)
Holub, J.: Personal Communication (1999)
Holub, J., Crochemore, M.: On the implementation of compact dAWG’s. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol. 2608, pp. 289–294. Springer, Heidelberg (2003)
Inenaga, S., Hoshino, H., Shinohara, A., Takeda, M., Arikawa, S., Mauri, G., Pavesi, G.: On-Line Construction of Compact Directed Acyclic Word Graphs .To appear in Discrete Applied Mathematics (special issue for (CPM 2001) (2001)
Inenaga, S., Hoshino, H., Shinohara, A., Takeda, M., Arikawa, S., Mauri, G., Pavesi, G.: On-line construction of compact directed acyclic word graphs. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol. 2089, pp. 169–180. Springer, Heidelberg (2001)
Lothaire, M.: Algebraic Combinatorics on Words. In: Encyclopedia of Mathematics and its Applications, vol. 90, Cambridge University Press, Cambridge (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Crochemore, M., Epifanio, C., Grossi, R., Mignosi, F. (2004). A Trie-Based Approach for Compacting Automata. In: Sahinalp, S.C., Muthukrishnan, S., Dogrusoz, U. (eds) Combinatorial Pattern Matching. CPM 2004. Lecture Notes in Computer Science, vol 3109. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27801-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-27801-6_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22341-2
Online ISBN: 978-3-540-27801-6
eBook Packages: Springer Book Archive