Pages that link to "Item:Q845868"
From MaRDI portal
The following pages link to The equivalence problem for deterministic MSO tree transducers is decidable (Q845868):
Displaying 4 items.
- Determinacy and rewriting of functional top-down and MSO tree transformations (Q730500) (← links)
- A faithful representation of non-associative Lambek grammars in abstract categorial grammars (Q972436) (← links)
- Deciding equivalence of top-down XML transformations in polynomial time (Q1021574) (← links)
- Decision problems of tree transducers with origin (Q1641005) (← links)
