Choosing Word Occurrences for the Smallest Grammar Problem

DOI10.1007/978-3-642-13089-2_13zbMath1284.68321OpenAlexW1541776932MaRDI QIDQ3564857

François Coste, Rafael Carrascosa, Gabriel Infante-Lopez, Matthias Gallé

Publication date: 26 May 2010

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13089-2_13

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Algorithms on strings (68W32)

Related Items (3)

Searching for smallest grammars on large sequences and application to DNA ⋮ Parameter reduction and automata evaluation for grammar-compressed trees ⋮ The smallest grammar problem as constituents choice and minimal grammar parsing

This page was built for publication: Choosing Word Occurrences for the Smallest Grammar Problem