FAQ

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2002-2016
02420022016

Related topics

Related topics

5 relations
Context-free grammarData compressionFormal languageGrammar-based code
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Smallest grammar problem
String
Data compression
Formal language
Context-free grammar
Grammar-based code

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… (More)
Is this relevant?
2016
2016
The Generalized Smallest Grammar Problem The Generalized Smallest Grammar Problem
The Smallest Grammar Problem – the problem of finding the smallest context-free grammar that generates exactly one given sequence… (More)
  • table 1
  • table 2
  • figure 1
Is this relevant?
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 sequence… (More)
  • table 1
  • table 2
  • figure 1
Is this relevant?
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… (More)
  • table 1
  • figure 1
  • figure 5
  • figure 2
  • figure 6
Is this relevant?
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… (More)
  • table 1
  • table 2
  • figure 1
  • table 3
  • figure 2
Is this relevant?
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… (More)
  • figure 2
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
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… (More)
  • figure 2.1
  • figure 2.2
  • table 2.3
  • figure 3.1
  • figure 3.2
Is this relevant?
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 practical… (More)
  • figure 2
  • table 2
Is this relevant?
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… (More)
  • figure 1
Is this relevant?
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… (More)
Is this relevant?