Pages that link to "Item:Q5191529"
From MaRDI portal
The following pages link to FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191529):
Displayed 6 items.
- The equivalence problem for deterministic MSO tree transducers is decidable (Q845868) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- Deaccumulation techniques for improving provability (Q882487) (← links)
- Visibly pushdown transducers (Q1672009) (← links)
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (Q2022308) (← links)
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles (Q2216430) (← links)