Pages that link to "Item:Q3631904"
From MaRDI portal
The following pages link to The Complexity of Monadic Second-Order Unification (Q3631904):
Displaying 6 items.
- Parameter reduction and automata evaluation for grammar-compressed trees (Q440015) (← links)
- A unification algorithm for second-order monadic terms (Q1109019) (← links)
- Fusion in relational structures and the verification of monadic second-order properties (Q3146251) (← links)
- Grammar-Based Tree Compression (Q3451087) (← links)
- Bounded Second-Order Unification Is NP-Complete (Q3527311) (← links)
- Linear pattern matching of compressed terms and polynomial rewriting (Q4585011) (← links)