Data compression using antidictionaries

Proceedings of the IEEE

Volumn 88, Issue 11, 2000, Pages 1756-1768

  Crochemore, Maxime ^a   Mignosi, Filippo ^b   Restivo, Antonio ^b   Salemi, Sergio ^b  

^a Université de Marne la Vallée   (France)

^b UNIVERSITY OF PALERMO   (Italy)

Author keywords

Data compression; Finite automaton; Forbidden word; Information theory; Lossless compression; Pattern matching

Indexed keywords

EID: 0001337979     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/5.892711     Document Type: Article

References (26)

1. J. G. Clcary, T. C. Bell. Mid I. H. Witten, Text Compression. Engiewood Cliffs, NJ: Prentice-Hall. 1990.
2. J. Gailly. (2000) Frequently asked questions in data compression. FAQ. [Online]htip://www.faqs.org/faqs/faqs/tOinpression-faq/
3. J. Gailly and M. Nelson, The Data Cowpressidn Bunk. New York: M&T Books. 1996.
4. J. A. Storer, Data Compression: Methods and Theory. Rockville, MD: Computer Science, 1988.
5. T. C. Bell, I. II. Witten. and A. Vloffat, Managing Gigabytes. New York: Van Nostrand. 1994.
6. C. Shannon, "Prediction and entropy of printed Bullish," Bell Syst. Tech. J.. vol. 30, pp. 50-64, Jan. 1951.
7. A. Resiivo, M.-P. Béal, and F. Vlignosi, "Minimal forbidden words and symbolic dynamics." in STACS'96. ser. 1046, Lecture Notes in Computer Science. C. Puech and R. Reischak. Eds. Berlin. Germany: Springer-Verlag, 1996, pp. 555-566.
8. A. Restivo, M.-P. Béal, K Mignosi. and M. Scionino, "Minimal forbidden words and symbolic dynamics," Adv. Appl. Main., to be published.
9. [91 A. Restivo, M. Crochemore, and F. Mignosi, "Minimal forbidden words and factor automata," in MFCS'VS. ser. 1450, Lecture Notes in Computer Science, J. Gruska, L. Brim, and J. Slatuska, Eds. Berlin, Germany: Springer-Verlag, 1998, pp. 665-673.
10. [I0] M. Crochemore. F. Mignosi, and A. Restivo, ''Automata and forbidden words," Inf. Process. Lett., vol. 67, no. 3, pp. 111-117, 1998.
11. A. Restivo, VI. Crochemore, F. Mignosi, and S. Salemi, "Text compression using antidictionaries." in ICALP'99. ser 1664, Lecture Notes in Computer Science, J. Gruska, L. Brim, and J. Slatuska, Eds. Berlin, Germany: Springer-Verlag, 1999.
12. C. Choffrul and K. Culik, "On extendibility of unavoidable sets," Discrete Appl. Mark., vol. 9, pp. 125 -137, 1984.
13. A. V. Aho and M. J. Corasick, "Efficient string matching: An aid to bibliographic search," Commun. ACM. vol. 18, no. 6, pp. 333-340, 1975.
14. VI. Crochemore and W. Rytter, Text Algorithms. London, U.K.: Oxford Univ. Press, 1994.
15. V. Diekert and Y. Kobayashi, "Some identities related to automata, determinants, and möbius functions," Universität Stuttgart, Rep. 1997/05, 1997.
16. J. Berstel and D. Pen-in, "Finite and infinite words," in Algebraic Combinatorics on Words, D. Perrin and J. Berstei, Eds. London, U.K.: Cambridge Univ. Press, to be published.
17. Y. Shibata, M. Takeda. A. Shinohara, and S. Arikawa, "Pattern matching in text compressed by using antidictionaries," in CPM'99. ser. 1645, Lecture Notes in Computer Science, M. Crochemore and M. Paterson, Eds. Berlin, Germany: Springer-Verlag, 1999, pp. 37-49.
18. M. P. Béal, Codage Symbolique: Masson, 1993.
19. R. Ash. Information Theory, Tract_, in Mathematics. New York: Interscience, Wiley, 1985.
20. R. G, Gtilljger, Information Theorv and Reliable Communication. New York: Wiley. 1968.
21. _, Discrete Stochastic Processes. Norweil. MA: Kluwer, 1995.
22. J. L. Snell and j. G. Kemeny. Finite Markov Chains. New York: Van Nostrand, 1960.
23. R. S. Ellis. Entropy, Large Deviations, and Statistical Mechanics. Berlin. Germany: Springer-Verlag, 1985.
24. C. Hancart and M. Crochemore. "Automata for matching patterns," Handbook of Formal Languages, vol. 2, 1997.
25. R. Kncbevskv, Universal Comprean Mii and Retrieval. Nurwell. MA: Kluwer, 1994.
26. M. Crocl-.emorc and R, Vérin, "On compact directed acyclic word graphs." in Stnictiiivi ir. Logic and Commuer Scitr.ce. ser. 1261, Lecture Notes in Computer Science, G. Rorcr.bcrg, J. Mycldski. and A. SaSoma;,. Eds. Berlin: Springer-Verlag, 1997, pp. 192-211.