Efficient Statistical Modeling for the Compression of Tree Structured Intermediate Code

DOI10.1093/COMJNL/46.5.476zbMATH Open1077.68641OpenAlexW2171541115MaRDI QIDQ4474739FDOQ4474739

Authors: Siddhartha Rai, Priti Shankar 

Publication date: 12 July 2004

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/441c1f3e938813114d043d3cf282bedd6f5e858f

Recommendations

• Syntax directed compression of trees using pushdown automata
• TREE COMPRESSION AND OPTIMIZATION WITH APPLICATIONS
• Smoothing and compression with stochastic \(k\)-testable tree languages
• Entropy and optimal compression of some general plane trees
• An effective grammar-based compression algorithm for tree structured data.

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cited In (2)

• Smoothing and compression with stochastic \(k\)-testable tree languages
• Generalized Context Modeling With Multi-Directional Structuring and MDL-Based Model Selection for Heterogeneous Data Compression

This page was built for publication: Efficient Statistical Modeling for the Compression of Tree Structured Intermediate Code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474739)