Pages that link to "Item:Q2965507"
From MaRDI portal
The following pages link to Approximation of smallest linear tree grammar (Q2965507):
Displaying 13 items.
- One-variable word equations in linear time (Q261339) (← links)
- Approximation of smallest linear tree grammar (Q342719) (← links)
- A bisection algorithm for grammar-based compression of ordered trees (Q407558) (← links)
- Approximation of grammar-based compression via recompression (Q500975) (← links)
- Constant-time tree traversal and subtree equality check for grammar-compressed trees (Q724220) (← links)
- A \textit{really} simple approximation of smallest grammar (Q906407) (← links)
- Tree compression using string grammars (Q1742370) (← links)
- Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
- Constructing Small Tree Grammars and Small Circuits for Formulas (Q2978536) (← links)
- Equality Testing of Compressed Strings (Q3449353) (← links)
- Grammar-Based Tree Compression (Q3451087) (← links)
- Regular Approximation of Weighted Linear Context-Free Tree Languages (Q4605512) (← links)
- Inductive Logic Programming (Q5897189) (← links)