A really simple approximation of smallest grammar

DOI10.1007/978-3-319-07566-2_19MaRDI QIDQ5165604zbMATH OpenOpenAlexFDO

Authors Artur Jeż

Publication date 30 June 2014

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-07566-2_19

zbMATH Keywords

compressionconstruction of the smallest grammargrammar-based compressionSLP

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42) Algorithms on strings (68W32)

Recommendations

• A \textit{really} simple approximation of smallest grammar
• Approximation of Grammar-Based Compression via Recompression
• Approximation of grammar-based compression via recompression
• The Smallest Grammar Problem
• String Processing and Information Retrieval

Cited in

(8)

• The smallest grammar problem revisited
• Constructing small tree grammars and small circuits for formulas
• scientific article; zbMATH DE number 4155910 (Why is no real title available?)
• REDUCING SIMPLE GRAMMARS: EXPONENTIAL AGAINST HIGHLY-POLYNOMIAL TIME IN PRACTICE
• The Smallest Grammar Problem
• Approximation of grammar-based compression via recompression
• Compressibility of Finite Languages by Grammars
• A \textit{really} simple approximation of smallest grammar

This page was built for publication: A really simple approximation of smallest grammar

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