Decomposing finite-valued transducers and deciding their equivalence
SIAM Journal on Computing
Automata, Languages, and Machines
Automata, Languages, and Machines
Validating streaming XML documents
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Information Processing Letters
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Visibly pushdown automata for streaming XML
Proceedings of the 16th international conference on World Wide Web
Adding nesting structure to words
Journal of the ACM (JACM)
On relations defined by generalized finite automata
IBM Journal of Research and Development
Equivalence of deterministic nested word to word transducers
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Lexicographic Decomposition of k-Valued Transducers
Theory of Computing Systems - Special Title: Symposium on Theoretical Aspects of Computer Science; Guest Editors: Susanne Albers, Pascal Weil
Properties of visibly pushdown transducers
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Queries on Xml streams with bounded delay and concurrency
Information and Computation
A uniformization theorem for nested word to word transductions
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
Visibly Pushdown Transducers (VPT) form a subclass of pushdown transducers. In this paper, we investigate the extension of VPT with visibly pushdown look-ahead (VPTla ). Their transitions are guarded by visibly pushdown automata that can check whether the well-nested subword starting at the current position belongs to the language they define. First, we show that VPTla are not more expressive than VPT, but are exponentially more succinct. Second, we show that the class of deterministic VPTla corresponds exactly to the class of functional VPT, yielding a simple characterization of functional VPT. Finally, we show that while VPTla are exponentially more succinct than VPT, checking equivalence of functional VPTla is, as for VPT, ExpT-C. As a consequence, we show that any functional VPT is equivalent to an unambiguous one.