Pages that link to "Item:Q1341717"
From MaRDI portal
The following pages link to Undecidable properties of deterministic top-down tree transducers (Q1341717):
Displayed 7 items.
- Polynomial-time inverse computation for accumulative functions with multiple data traversals (Q526439) (← links)
- Linear generalized semi-monadic rewrite systems effectively preserve recognizability (Q1127543) (← links)
- Completion after Program Inversion of Injective Functions (Q5170160) (← links)
- Classes of Tree Homomorphisms with Decidable Preservation of Regularity (Q5458355) (← links)
- The Power of Weighted Regularity-Preserving Multi Bottom-Up Tree Transducers (Q5744132) (← links)
- The HOM Problem is EXPTIME-Complete (Q5895159) (← links)
- Alphabetic and synchronized tree transducers (Q5941078) (← links)