The relationship between greedy parsing and symbolwise text compression

DOI10.1145/179812.179892zbMath0812.68071OpenAlexW2063073149WikidataQ59821294 ScholiaQ59821294MaRDI QIDQ4310842

Timothy C. Bell, Ian H. Witten

Publication date: 3 November 1994

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/179812.179892

zbMATH Keywords

parsinggreedy parsing methodtext compression methods

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Data encryption (aspects in computer science) (68P25) Coding theorems (Shannon theory) (94A24)

Related Items (3)

On optimal parsing for LZ78-like compressors ⋮ Dictionary-symbolwise flexible parsing ⋮ Dictionary-Symbolwise Flexible Parsing

This page was built for publication: The relationship between greedy parsing and symbolwise text compression