Pages that link to "Item:Q1825674"
From MaRDI portal
The following pages link to Top-down tree transducers with deterministic top-down look-ahead (Q1825674):
Displayed 16 items.
- Branching synchronization grammars with nested tables (Q596320) (← links)
- Decidability of equivalence for deterministic synchronized tree automata (Q671682) (← links)
- Deterministic top-down tree transducers with iterated look-ahead (Q673068) (← links)
- Storage-to-tree transducers with look-ahead (Q706619) (← links)
- A complete rewriting system for a monoid of tree transformation classes (Q918216) (← links)
- Deciding equivalence of top-down XML transformations in polynomial time (Q1021574) (← links)
- Top-down tree transducers with two-way tree walking look-ahead (Q1185007) (← links)
- Decidability of the finiteness of ranges of tree transductions (Q1271464) (← links)
- Synchronized tree automata (Q1325832) (← links)
- The translation power of top-down tree-to-graph transducers (Q1337465) (← links)
- Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations (Q1351783) (← links)
- Deterministic top-down tree automata with Boolean deterministic look-ahead (Q2163373) (← links)
- A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead (Q2390283) (← links)
- Variants of top-down tree transducers with look-ahead (Q3832064) (← links)
- A hierarchy of deterministic top-down tree transformations (Q4866680) (← links)
- Alphabetic and synchronized tree transducers (Q5941078) (← links)