Properties of visibly pushdown transducers
From MaRDI portal
Publication:3586097
DOI10.1007/978-3-642-15155-2_32zbMATH Open1287.68095arXiv1002.1443OpenAlexW1599939219MaRDI QIDQ3586097FDOQ3586097
Authors: Emmanuel Filiot, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot, Jean-François Raskin 
Publication date: 3 September 2010
Published in: Mathematical Foundations of Computer Science 2010 (Search for Journal in Brave)
Abstract: Visibly pushdown transducers form a subclass of pushdown transducers that (strictly) extends finite state transducers with a stack. Like visibly pushdown automata, the input symbols determine the stack operations. In this paper, we prove that functionality is decidable in PSpace for visibly pushdown transducers. The proof is done via a pumping argument: if a word with two outputs has a sufficiently large nesting depth, there exists a nested word with two outputs whose nesting depth is strictly smaller. The proof uses technics of word combinatorics. As a consequence of decidability of functionality, we also show that equivalence of functional visibly pushdown transducers is Exptime-Complete.
Full work available at URL: https://arxiv.org/abs/1002.1443
Recommendations
Cited In (11)
- Queries on XML streams with bounded delay and concurrency
- Trimming visibly pushdown automata
- Visibly pushdown transducers with well-nested outputs
- Colored nested words
- Efficient determinization of visibly and height-deterministic pushdown automata
- Expressiveness of visibly pushdown transducers
- Title not available (Why is that?)
- Visibly pushdown transducers with well-nested outputs
- Visibly pushdown transducers with look-ahead
- Visibly Pushdown Transducers
- Visibly pushdown transducers
This page was built for publication: Properties of visibly pushdown transducers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586097)
