The following pages link to The Smallest Grammar Problem (Q3546682):
Displaying 50 items.
- Approximation of smallest linear tree grammar (Q342719) (← links)
- Straight-line programs: a practical test (extended abstract) (Q376125) (← links)
- Compact q-gram profiling of compressed strings (Q401308) (← links)
- A bisection algorithm for grammar-based compression of ordered trees (Q407558) (← links)
- Searching for smallest grammars on large sequences and application to DNA (Q414452) (← links)
- Parameter reduction and automata evaluation for grammar-compressed trees (Q440015) (← links)
- Approximation of grammar-based compression via recompression (Q500975) (← links)
- Compressed subsequence matching and packed tree coloring (Q513266) (← links)
- Functional programs as compressed data (Q526441) (← links)
- Leaf languages and string compression (Q550251) (← links)
- LZ77 computation based on the run-length encoded BWT (Q724214) (← links)
- Constant-time tree traversal and subtree equality check for grammar-compressed trees (Q724220) (← links)
- Upper bounds on distinct maximal (sub-)repetitions in compressed strings (Q832954) (← links)
- The complexity of tree automata and XPath on grammar-compressed trees (Q860863) (← links)
- Binary jumbled pattern matching on trees and tree-like structures (Q893318) (← links)
- A \textit{really} simple approximation of smallest grammar (Q906407) (← links)
- Variable-length coding of two-sided asymptotically mean stationary measures (Q966513) (← links)
- Approximability of minimum AND-circuits (Q1024782) (← links)
- Comparison of LZ77-type parsings (Q1621503) (← links)
- A separation between RLSLPs and LZ77 (Q1632509) (← links)
- Inductive synthesis of cover-grammars with the help of ant colony optimization (Q1692068) (← links)
- Time-space trade-offs for Lempel-Ziv compressed indexing (Q1694685) (← links)
- Knapsack in graph groups (Q1702854) (← links)
- On the compressibility of finite languages and formal proofs (Q1706152) (← links)
- Universal compressed text indexing (Q1729689) (← links)
- The smallest grammar problem as constituents choice and minimal grammar parsing (Q1736491) (← links)
- Tree compression using string grammars (Q1742370) (← links)
- Learning grammars for architecture-specific facade parsing (Q1800054) (← links)
- Improved approximation algorithms for minimum AND-circuits problem via \(k\)-set cover (Q1944076) (← links)
- Lower bounds for context-free grammars (Q1944159) (← links)
- Staged self-assembly and polyomino context-free grammars (Q2003475) (← links)
- Compaction of Church numerals (Q2005559) (← links)
- On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
- Balancing straight-line programs for strings and trees (Q2106614) (← links)
- Compression techniques in group theory (Q2117795) (← links)
- An LMS-based grammar self-index with local consistency properties (Q2146131) (← links)
- On the approximation ratio of LZ-end to LZ77 (Q2146133) (← links)
- The compressed word problem in relatively hyperbolic groups (Q2153344) (← links)
- Block trees (Q2221797) (← links)
- Cadences in grammar-compressed strings (Q2232293) (← links)
- The complexity of compressed membership problems for finite automata (Q2254509) (← links)
- Compressed range minimum queries (Q2297849) (← links)
- Finger search in grammar-compressed strings (Q2322694) (← links)
- Approximate pattern matching in LZ77-compressed texts (Q2343301) (← links)
- Tree compression with top trees (Q2347804) (← links)
- Block graphs in practice (Q2363994) (← links)
- Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
- Fingerprints in compressed strings (Q2396828) (← links)
- Grammar compressed sequences with rank/select support (Q2397151) (← links)
- Document listing on repetitive collections with guaranteed performance (Q2632016) (← links)
