Text compression using antidictionaries

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1644 LNCS, Issue , 1999, Pages 261-270

  Crochemore, M ^a   Mignosi, F ^b   Restivo, A ^b   Salemi, S ^b  

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

^b UNIVERSITY OF PALERMO   (Italy)

Author keywords

Data compression; Finite automaton; For bidden word; Information theory; Pattern matching

Indexed keywords

DATA COMPRESSION; FINITE AUTOMATA; PATTERN MATCHING;

ANTIDICTIONARIES; BINARY SOURCES; COMPRESSED DATUM; DECOMPRESSORS; FIXED SOURCE; FOR- BIDDEN WORD; SYNCHRONIZATION PROPERTY; TEXT COMPRESSIONS;

INFORMATION THEORY;

EID: 84887454628     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_23     Document Type: Conference Paper

References (20)

1. A. V. Aho, M. J. Corasick. Eficient string matching: An aid to bibliographic search. Comm. ACM 18:6 (1975) 333-340.
2. R. Ash. Information Theory. Tracts in mathematics, Interscience Publishers, J. Wiley & Sons, 1985.
3. M. P. Beal. Codage Symbolique. Masson, 1993.
4. M.P. Beal, F. Mignosi, A. Restivo. Minimal Forbidden Words and Symbolic Dynamics. in (STACS'96, C. Puech and R. Reischuk, eds., LNCS 1046, Springer, 1996) 555-566.
5. J. Berstel, D. Perrin. Finite and infinite words. in (Algebraic Combinatorics on Words, J. Berstel, D. Perrin, eds., Cambridge University Press, to appear) Chapter Available at http://www-igm.univ-mlv.fr/berstel.
6. C. Chorut, K. Culik. On Extendibility of Unavoidable Sets. Discrete Appl. Math., 9, 1984, 125-137.
7. T. C. Bell, J. G. Cleary, I. H. Witten. Text Compression. Prentice Hall, 1990.
8. M. Crochemore, F. Mignosi, A. Restivo. Minimal Forbidden Words and Factor Automata. in (MFCS'98, L. Brim, J. Gruska, J. Slatuska, eds., LNCS 1450, Springer, 1998) 665-673.
9. M. Crochemore, F. Mignosi, A. Restivo. Automata and Forbidden Words. Information Processing Letters 67 (1998) 111-117.
10. M. Crochemore, F. Mignosi, A. Restivo, S. Salemi. Search in Compressed Data. in preparation.
11. M. Crochemore, F. Mignosi, A. Restivo, S. Salemi. A Compressor Compiler. in preparation.
12. M. Crochemore, W. Rytter. Text Algorithms. Oxford University Press, 1994.
13. V. Diekert, Y. Kobayashi. Some Identities Related to Automata, Determinants, and Mobius Functions. Report Nr. 1997/05, Universitat Stuttgart, Fakultat Informatik, 1997.
14. R. S. Ellis. Entropy, Large Deviations, and Statistical Mechanics. Springer Verlag, 1985.
15. J. Gailly. Frequently Asked Questions in data compression, Internet. At the present time available at URL http://www.landfield.com/faqs/compression-faq/ .
16. J. G. Kemeny, J. L. Snell. Finite Markov Chains. Van Nostrand Reinhold, 1960.
17. M. Nelson, J. Gailly. The Data Compression Book. M&T Books, New York, NY, 1996. 2nd edition.
18. C. Shannon. Prediction and entropy of printed english. Bell System Technical J., 50-64, January, 1951.
19. J. A. Storer. Data Compression: Methods and Theory. Computer Science Press, Rockville, MD, 1988.
20. I. H. Witten, A. Moat, T. C. Bell. Managing Gigabytes. Van Nostrand Reinhold, 1994.