Pages that link to "Item:Q4608715"
From MaRDI portal
The following pages link to Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars (Q4608715):
Displaying 7 items.
- Parameter reduction and automata evaluation for grammar-compressed trees (Q440015) (← links)
- The complexity of tree automata and XPath on grammar-compressed trees (Q860863) (← links)
- Complexity of decision problems on totally rigid acyclic tree grammars (Q1622974) (← links)
- Anti-unification and the theory of semirings (Q2215964) (← links)
- On the generation of quantified lemmas (Q2417949) (← links)
- Higher-order pattern generalization modulo equational theories (Q5139277) (← links)
- Compressibility of Finite Languages by Grammars (Q5500684) (← links)