Pushdown compression

Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008

Volumn , Issue , 2008, Pages 39-48

  Albert, P ^a   Mayordomo, E ^a   Moser, P ^b   Perifel, S ^c  

^a UNIVERSITY OF ZARAGOZA   (Spain)

^b NATIONAL UNIVERSITY OF IRELAND   (Ireland)

^c UNIV LYON   (France)

Author keywords

Finite state compression; Lempel Ziv algorithm; Pumping lemma; Pushdown compression; XML document

Indexed keywords

DATA COMPRESSION RATIO; TRANSDUCERS; XML;

COMPRESSION ALGORITHMS; COMPRESSION SCHEME; FINITE STATE; FORMAL ANALYSIS; LEMPEL-ZIV ALGORITHMS; PUMPING LEMMA; PUSHDOWN; XML COMPRESSION;

COMPRESSORS;

EID: 45749157198     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. J. Autebert, J. Berstel, and L. Boasson. Context-free languages and pushdown automata. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 1, Word, Language, Grammar, pages 111-174. Springer-Verlag, 1997.
2. J. J. Dai, J. I. Lathrop, J. H. Lutz, and E. Mayordomo. Finite-state dimension. Theoretical Computer Science, 310:1-33, 2004.
3. D. Doty and J. Nichols. Pushdown dimension. Theoretical Computer Science, 381(1-3):105-123, 2007.
4. S. Ginsburg and G. F. Rose. Preservation of languages by transducers. Information and Control, 9(2):153-176, 1966.
5. S. Ginsburg and G. F. Rose. A note on preservation of languages by transducers. Information and Control, 12(5/6):549-552, 1968.
6. S. Hariharan and P. Shankar. Evaluating the role of context in syntax directed compression of xml documents. In Proceedings of the 2006 IEEE Data Compression Conference (DCC 2006), page 453, 2006.
7. J. M. Hitchcock. Effective Fractal Dimension: Foundations and Applications. PhD thesis, Iowa State University, 2003.
8. J. I. Lathrop and M. J. Strauss. A universal upper bound on the performance of the Lempel-Ziv algorithm on maliciously-constructed data. In B. Carpentieri, editor, Compression and Complexity of Sequences '97, pages 123-135. IEEE Computer Society Press, 1998.
9. C. League and K. Eng. Type-based compression of xml data. In Proceedings of the 2007 IEEE Data Compression Conference (DCC 2007), pages 272-282, 2007.
10. A. Lempel and J. Ziv. Compression of individual sequences via variable rate coding. IEEE Transaction on Information Theory, 24:530-536, 1978.
11. H. R. Lewis and C. H. Papadimitriou. Elements of the Theory of Computation. Prentice Hall PTR, Upper Saddle River, NJ, USA, 1997.
12. M. López-Valdés and E. Mayordomo. Dimension is compression. In Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science, volume 3618 of Lecture Notes in Computer Science, pages 676-685. Springer-Verlag, 2005.
13. E. Mayordomo. Effective fractal dimension in algorithmic information theory. In New Computational Paradigms: Changing Conceptions of What is Computable, pages 259-285. Springer-Verlag, 2008.
14. D. Sculley and C. E. Brodley. Compression and machine learning: A new perspective on feature space vectors. In Proceedings of the Data Compression Conference (DCC-2006), pages 332-341, 2006.