Pages that link to "Item:Q1096399"
From MaRDI portal
The following pages link to High level tree transducers and iterated pushdown tree transducers (Q1096399):
Displaying 20 items.
- Functional programs as compressed data (Q526441) (← links)
- Deterministic top-down tree transducers with iterated look-ahead (Q673068) (← links)
- Modular tree transducers (Q807012) (← links)
- A complete rewriting system for a monoid of tree transformation classes (Q918216) (← links)
- Iterated stack automata and complexity classes (Q1183602) (← 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)
- The equivalence of bottom-up and top-down tree-to-graph transducers (Q1271618) (← links)
- The translation power of top-down tree-to-graph transducers (Q1337465) (← links)
- Transducers and the decidability of independence in free monoids (Q1341744) (← links)
- Output string languages of compositions of deterministic macro tree transducers (Q1608323) (← links)
- Macro tree transducers, attribute grammars, and MSO definable tree translations. (Q1854312) (← links)
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (Q2022308) (← links)
- Principal abstract families of weighted tree languages (Q2064529) (← links)
- Composing stack-attributed tree transducers (Q2272204) (← links)
- Weighted automata with storage (Q2280328) (← links)
- A hierarchy of deterministic top-down tree transformations (Q4866680) (← links)
- Tree-stack automata (Q4879207) (← links)
- (Q5089205) (← links)
- Verification of tree-processing programs via higher-order mode checking (Q5740641) (← links)
