Pages that link to "Item:Q1271464"
From MaRDI portal
The following pages link to Decidability of the finiteness of ranges of tree transductions (Q1271464):
Displayed 11 items.
- Branching synchronization grammars with nested tables (Q596320) (← links)
- The generative power of delegation networks (Q897662) (← links)
- Look-ahead removal for total deterministic top-down tree transducers (Q906394) (← links)
- Tree-based picture generation (Q1583092) (← links)
- Output string languages of compositions of deterministic macro tree transducers (Q1608323) (← links)
- Decision problems of tree transducers with origin (Q1641005) (← links)
- Deciding origin equivalence of weakly self-nesting macro tree transducers (Q2680223) (← links)
- Selected Decision Problems for Square-Refinement Collage Grammars (Q3098030) (← links)
- Decision Problems of Tree Transducers with Origin (Q3449477) (← links)
- GETGRATS (Q4923529) (← links)
- Deciding whether an attributed translation can be realized by a top-down transducer (Q6199878) (← links)