Pages that link to "Item:Q1341717"
From MaRDI portal
The following pages link to Undecidable properties of deterministic top-down tree transducers (Q1341717):
Displaying 14 items.
- Polynomial-time inverse computation for accumulative functions with multiple data traversals (Q526439) (← links)
- Undecidable properties of flat term rewrite systems (Q734041) (← links)
- The emptiness problem is undecidable for domains of partial monadic 2- modular tree transformations (Q918726) (← links)
- Linear generalized semi-monadic rewrite systems effectively preserve recognizability (Q1127543) (← links)
- Decidability of the finiteness of ranges of tree transductions (Q1271464) (← links)
- Some decidability results on one-pass reductions (Q2423761) (← links)
- (Q4414526) (← links)
- It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton (Q4601120) (← 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)
- Definability Results for Top-Down Tree Transducers (Q6169966) (← links)
