The smallest grammar problem revisited
From MaRDI portal
Publication:1796825
DOI10.1007/978-3-319-46049-9_4zbMath1397.68072arXiv1908.06428OpenAlexW2522260339MaRDI QIDQ1796825
Carl Philipp Reh, Markus Lohrey, Danny Hucke
Publication date: 17 October 2018
Full work available at URL: https://arxiv.org/abs/1908.06428
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42)
Related Items (6)
A separation between RLSLPs and LZ77 ⋮ Document listing on repetitive collections with guaranteed performance ⋮ Grammar-compressed indexes with logarithmic search time ⋮ On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation ⋮ Diverse Palindromic Factorization is NP-Complete ⋮ On the complexity of the smallest grammar problem over fixed alphabets
This page was built for publication: The smallest grammar problem revisited
