Visibly pushdown transducers
From MaRDI portal
Publication:1672009
DOI10.1016/J.JCSS.2018.05.002zbMath1398.68307OpenAlexW2881695248WikidataQ129576861 ScholiaQ129576861MaRDI QIDQ1672009
Frédéric Servais, Jean-François Raskin, Jean-Marc Talbot, Emmanuel Filiot, Pierre-Alain Reynier
Publication date: 7 September 2018
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2018.05.002
Related Items (3)
Checking regular invariance under tightly-controlled string modifications ⋮ Unnamed Item ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computer aided verification. 24th international conference, CAV 2012, Berkeley, CA, USA, July 7--13, 2012. Proceedings
- On the complexity of typechecking top-down XML transformations
- Frontiers of tractability for typechecking simple XML transformations
- Macro forest transducers
- Macro tree transducers
- Sur les rélations rationnelles entre monoides libres
- Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
- On tree transducers for partial functions
- Query automata over finite trees
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
- Some decision problems concerning semilinearity and commutation.
- Economy of description for single-valued transducers
- Lexicographic decomposition of \(k\)-valued transducers
- Visibly Pushdown Transducers with Look-Ahead
- Query Automata for Nested Words
- Earliest Query Answering for Deterministic Nested Word Automata
- Equivalence of Deterministic Nested Word to Word Transducers
- Adding nesting structure to words
- Marrying Words and Trees
- Visibly Pushdown Transducers
- Visibly pushdown languages
- Properties of Visibly Pushdown Transducers
- First-Order and Temporal Logics for Nested Words
- Temporal Reasoning for Procedural Programs
- A note on finite-valued and finitely ambiguous transducers
- Decomposing Finite-Valued Transducers and Deciding Their Equivalence
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Macro Tree Translations of Linear Size Increase are MSO Definable
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Nested interpolants
- A Uniformization Theorem for Nested Word to Word Transductions
- Automated Deduction – CADE-20
- Visibly Pushdown Transducers for Approximate Validation of Streaming XML
- On Relations Defined by Generalized Finite Automata
- The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
- Visibly Pushdown Transducers with Well-Nested Outputs
This page was built for publication: Visibly pushdown transducers
