Visibly pushdown transducers
type: Item
instance of: scholarly article
title: Visibly pushdown transducers
zbMATH Open document ID: 1398.68307
author: Emmanuel Filiot
author: Jean-François Raskin
author: Pierre-Alain Reynier
author: Frédéric Servais
author: Jean-Marc Talbot
published in: Journal of Computer and System Sciences
publication date: 2018-09-07T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6934103
zbMATH Keywords: visibly pushdown automata
zbMATH Keywords: transducers
zbMATH Keywords: functionality
describes a project that uses: XQuery
describes a project that uses: SAX
MaRDI profile type: Publication
full work available at URL: j.jcss.2018.05.002
OpenAlex ID: W2881695248
cites work: Marrying Words and Trees
cites work: First-Order and Temporal Logics for Nested Words
cites work: Temporal Reasoning for Procedural Programs
cites work: Visibly pushdown languages
cites work: Adding nesting structure to words
cites work: Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
cites work: A Uniformization Theorem for Nested Word to Word Transductions
cites work: Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
cites work: Q4079524
cites work: On Relations Defined by Generalized Finite Automata
cites work: On tree transducers for partial functions
cites work: Macro Tree Translations of Linear Size Increase are MSO Definable
cites work: Macro tree transducers
cites work: Streamability of nested word transductions
cites work: Properties of Visibly Pushdown Transducers
cites work: Visibly Pushdown Transducers with Look-Ahead
cites work: Earliest Query Answering for Deterministic Nested Word Automata
cites work: The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
cites work: A note on finite-valued and finitely ambiguous transducers
cites work: Some decision problems concerning semilinearity and commutation.
cites work: Computer aided verification. 24th international conference, CAV 2012, Berkeley, CA, USA, July 7--13, 2012. Proceedings
cites work: Nested interpolants
cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems
cites work: Query Automata for Nested Words
cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
cites work: Q4414526
cites work: On the complexity of typechecking top-down XML transformations
cites work: Frontiers of tractability for typechecking simple XML transformations
cites work: Q5590814
cites work: Query automata over finite trees
cites work: Macro forest transducers
cites work: Visibly Pushdown Transducers
cites work: Visibly Pushdown Transducers with Well-Nested Outputs
cites work: Lexicographic decomposition of \(k\)-valued transducers
cites work: Sur les rélations rationnelles entre monoides libres
cites work: Equivalence of Deterministic Nested Word to Word Transducers
cites work: Visibly Pushdown Transducers for Approximate Validation of Streaming XML
cites work: Automated Deduction – CADE-20
cites work: Decomposing Finite-Valued Transducers and Deciding Their Equivalence
cites work: Economy of description for single-valued transducers
Wikidata QID: Q129576861
DOI: 10.1016/J.JCSS.2018.05.002
description: scientific article; zbMATH DE number 6934103