The smallest grammar problem as constituents choice and minimal grammar parsing
From MaRDI portal
Publication:1736491
DOI10.3390/A4040262zbMATH Open1461.68096OpenAlexW2120469941MaRDI QIDQ1736491FDOQ1736491
Authors: Rafael Carrascosa, François Coste, Matthias Gallé, Gabriel Infante-Lopez
Publication date: 26 March 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a4040262
Recommendations
Cites Work
- Algorithms on Strings, Trees and Sequences
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Compression of individual sequences via variable-rate coding
- Title not available (Why is that?)
- A universal algorithm for sequential data compression
- Efficient learning of context-free grammars from positive structural examples
- The Smallest Grammar Problem
- Title not available (Why is that?)
- Grammar-based codes: a new class of universal lossless source codes
- Linear-time text compression by longest-first substitution
- Choosing word occurrences for the smallest grammar problem
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: The smallest grammar problem as constituents choice and minimal grammar parsing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736491)