FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
From MaRDI portal
Publication:5191529
DOI10.1007/b94618zbMath1205.68208OpenAlexW2246750081MaRDI QIDQ5191529
Publication date: 6 August 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b94618
Related Items
The equivalence problem for deterministic MSO tree transducers is decidable ⋮ Visibly pushdown transducers ⋮ Automata for XML -- a survey ⋮ Deaccumulation techniques for improving provability ⋮ XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles ⋮ Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
