Approximating the smallest grammar

DOI10.1145/509907.510021MaRDI QIDQ3579221zbMATH OpenOpenAlexFDO

Authors Eric Lehman, Ding Liu, Panigrahy Rina, Manoj Prabhakaran, April Rasala, Amit Sahai, Abhi Shelat, Moses Charikar

Publication date 5 August 2010

Published in Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Grammars and rewriting systems (68Q42)

Cited in

(10)

• Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
• Learning grammars for architecture-specific facade parsing
• Generalized substring compression
• One-dimensional staged self-assembly
• A fully linear-time approximation algorithm for grammar-based compression
• Finite state incompressible infinite sequences
• One-dimensional staged self-assembly
• A circuit complexity formulation of algorithmic information theory
• Grammar-based compression and its use in symbolic music analysis
• Finite state complexity

This page was built for publication: Approximating the smallest grammar

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