Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

6 relations
Context-free grammarData compressionFormal languageGrammar-based code
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
The Smallest Grammar Problem Revisited
In a seminal paper of Charikar et al. on the smallest grammar problem, the authors derive upper and lower bounds on the… Expand
2016
2016
The Generalized Smallest Grammar Problem
The Smallest Grammar Problem -- the problem of finding the smallest context-free grammar that generates exactly one given… Expand
  • table 1
  • table 2
  • figure 1
2014
2014
Music Analysis as a Smallest Grammar Problem
In this paper we present a novel approach to music analysis, in which a grammar is automatically generated explaining a musical… Expand
  • table 1
  • figure 1
  • figure 5
  • figure 2
  • figure 6
2013
2013
An effective heuristic for the smallest grammar problem
The smallest grammar problem is the problem of finding the smallest context-free grammar that generates exactly one given… Expand
  • table 1
  • table 2
  • figure 1
  • table 3
  • figure 2
2012
2012
Searching for smallest grammars on large sequences and application to DNA
Motivated by the inference of the structure of genomic sequences, we address here the smallest grammar problem. In previous work… Expand
  • table 1
  • table 2
  • table 3
  • figure 1
  • figure 2
2011
2011
Searching for Compact Hierarchical Structures in DNA by means of the Smallest Grammar Problem
Motivated by the goal of discovering hierarchical structures inside DNA sequences, we address the Smallest Grammar Problem, the… Expand
  • figure 2.1
  • table 2.1
  • figure 2.2
  • table 2.2
  • table 2.3
2011
2011
The Smallest Grammar Problem as Constituents Choice and Minimal Grammar Parsing
The smallest grammar problem—namely, finding a smallest context-free grammar that generates exactly one sequence—is of practical… Expand
  • figure 2
  • table 1
  • table 2
  • table 3
  • table 4
2010
2010
Choosing Word Occurrences for the Smallest Grammar Problem
The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of… Expand
  • figure 2
  • table 2
Highly Cited
2005
Highly Cited
2005
The smallest grammar problem
This paper addresses the smallest grammar problem: What is the smallest context-free grammar that generates exactly one given… Expand
  • figure 1
2002
2002
Approximation algorithms for grammar-based data compression
This thesis considers the smallest grammar problem: find the smallest context-free grammar that generates exactly one given… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE