Visibly pushdown transducers with look-ahead
From MaRDI portal
Publication:2891373
DOI10.1007/978-3-642-27660-6_21zbMATH Open1298.68133OpenAlexW1814277478MaRDI QIDQ2891373FDOQ2891373
Authors: Emmanuel Filiot, Frédéric Servais
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
Recommendations
Cites Work
- Top-down tree transducers with regular look-ahead
- Lexicographic decomposition of \(k\)-valued transducers
- Visibly pushdown languages
- Title not available (Why is that?)
- Adding nesting structure to words
- On Relations Defined by Generalized Finite Automata
- Decomposing Finite-Valued Transducers and Deciding Their Equivalence
- Sur les rélations rationnelles entre monoides libres
- On tree transducers for partial functions
- Macro forest transducers
- Macro tree transducers
- Visibly Pushdown Transducers
- Properties of visibly pushdown transducers
- Queries on XML streams with bounded delay and concurrency
- Equivalence of Deterministic Nested Word to Word Transducers
Cited In (6)
This page was built for publication: Visibly pushdown transducers with look-ahead
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891373)