Skip to search formSkip to main contentSkip to account menu

Smallest grammar problem

In data compression and the theory of formal languages, the smallest grammar problem is the problem of finding the smallest context-free grammar that… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In a seminal paper of Charikar et al. on the smallest grammar problem, the authors derive upper and lower bounds on the… 
2016
2016
The Smallest Grammar Problem -- the problem of finding the smallest context-free grammar that generates exactly one given… 
2014
2014
In this paper we present a novel approach to music analysis, in which a grammar is automatically generated explaining a musical… 
2013
2013
The smallest grammar problem is the problem of finding the smallest context-free grammar that generates exactly one given… 
2011
2011
Motivated by the goal of discovering hierarchical structures inside DNA sequences, we address the Smallest Grammar Problem, the… 
2011
2011
The smallest grammar problem—namely, finding a smallest context-free grammar that generates exactly one sequence—is of practical… 
2010
2010
The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of… 
Highly Cited
2005
Highly Cited
2005
This paper addresses the smallest grammar problem: What is the smallest context-free grammar that generates exactly one given… 
2002
2002
This thesis considers the smallest grammar problem: find the smallest context-free grammar that generates exactly one given…