Pages that link to "Item:Q4429669"
From MaRDI portal
The following pages link to Macro Tree Translations of Linear Size Increase are MSO Definable (Q4429669):
Displaying 19 items.
- Composition closure of linear extended top-down tree transducers (Q519891) (← links)
- Polynomial-time inverse computation for accumulative functions with multiple data traversals (Q526439) (← links)
- Determinacy and rewriting of functional top-down and MSO tree transformations (Q730500) (← links)
- The equivalence problem for deterministic MSO tree transducers is decidable (Q845868) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- Decision problems of tree transducers with origin (Q1641005) (← links)
- Visibly pushdown transducers (Q1672009) (← links)
- Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← links)
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (Q2022308) (← links)
- Recognizability, hypergraph operations, and logical types (Q2496296) (← links)
- Linking theorems for tree transducers (Q2628796) (← links)
- A survey on decidable equivalence problems for tree transducers (Q2800413) (← links)
- Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time (Q2817401) (← links)
- Earliest normal form and minimization for bottom-up tree transducers (Q2909099) (← links)
- Tree Transformations and Dependencies (Q3172824) (← links)
- Decision Problems of Tree Transducers with Origin (Q3449477) (← links)
- GETGRATS (Q4923529) (← links)
- Copyful Streaming String Transducers (Q4989167) (← links)
- (Q5090989) (← links)