Visibly Pushdown Transducers with Look-Ahead
From MaRDI portal
Publication:2891373
DOI10.1007/978-3-642-27660-6_21zbMath1298.68133OpenAlexW1814277478MaRDI QIDQ2891373
Frédéric Servais, Emmanuel Filiot
Publication date: 15 June 2012
Published in: SOFSEM 2012: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-27660-6_21
Related Items
Colored nested words, A simple method for building bimachines from functional finite-state transducers, Visibly pushdown transducers, Look-ahead removal for total deterministic top-down tree transducers
Cites Work
- Unnamed Item
- Queries on XML streams with bounded delay and concurrency
- Macro forest transducers
- Macro tree transducers
- Sur les rélations rationnelles entre monoides libres
- On tree transducers for partial functions
- Lexicographic decomposition of \(k\)-valued transducers
- Equivalence of Deterministic Nested Word to Word Transducers
- Adding nesting structure to words
- Visibly Pushdown Transducers
- Visibly pushdown languages
- Properties of Visibly Pushdown Transducers
- Decomposing Finite-Valued Transducers and Deciding Their Equivalence
- Top-down tree transducers with regular look-ahead
- On Relations Defined by Generalized Finite Automata
