Pages that link to "Item:Q2035481"
From MaRDI portal
The following pages link to On the complexity of the smallest grammar problem over fixed alphabets (Q2035481):
Displaying 5 items.
- Searching for smallest grammars on large sequences and application to DNA (Q414452) (← links)
- On minimal grammar problems for finite languages (Q1622981) (← links)
- The smallest grammar problem as constituents choice and minimal grammar parsing (Q1736491) (← links)
- Finding the smallest binarization of a CFG is NP-hard (Q2637648) (← links)
- Pareto grammars (Q6621946) (← links)