Approximating the smallest grammar
- 19 May 2002
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 792-801
- https://doi.org/10.1145/509907.510021
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Universal lossless compression via multilevel pattern matchingIEEE Transactions on Information Theory, 2000
- Grammar-based codes: a new class of universal lossless source codesIEEE Transactions on Information Theory, 2000
- Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context modelsIEEE Transactions on Information Theory, 2000
- Compression and Explanation using Hierarchical GrammarsThe Computer Journal, 1997
- Compression of individual sequences via variable-rate codingIEEE Transactions on Information Theory, 1978
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977