A really Simple Approximation of Smallest Grammar

DOI10.1007/978-3-319-07566-2_19zbMath1407.68155OpenAlexW2216357326MaRDI QIDQ5165604

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

compressiongrammar-based compressionSLPconstruction of the smallest grammar

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)

Related Items (1)

Compressibility of Finite Languages by Grammars

This page was built for publication: A really Simple Approximation of Smallest Grammar