Single-valuedness of tree transducers is decidable in polynomial time
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Equivalence of finite-valued tree transducers is decidable
Mathematical Systems Theory
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
Squaring transducers: an efficient procedure for deciding functionality and sequentiality
Theoretical Computer Science
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Sur les relations rationnelles
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Testing Equivalence of Morphisms on Context-Free Languages
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Structured Document Transformations Based on XSL
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
Information Processing Letters
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The equivalence problem for deterministic MSO tree transducers is decidable
Information Processing Letters
Attribute grammars for scalable query processing on XML streams
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Equivalence of deterministic nested word to word transducers
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
On the complexity of equational horn clauses
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
View update translation for XML
Proceedings of the 14th International Conference on Database Theory
Queries on Xml streams with bounded delay and concurrency
Information and Computation
Normalization of sequential top-down tree-to-word transducers
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Model checking recursive programs with numeric data types
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Visibly pushdown transducers with look-ahead
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Visibly pushdown automata with multiplicities: finiteness and k-boundedness
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
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 (VPTs) form a strict subclass of pushdown transducers (PTs) that extends finite state transducers with a stack. Like visibly pushdown automata, the input symbols determine the stack operations. It has been shown that visibly pushdown languages form a robust subclass of context-free languages. Along the same line, we show that word transductions defined by VPTs enjoy strong properties, in contrast to PTs. In particular, functionality is decidable in PTIME, k-valuedness is in NPTIME and equivalence of (non-deterministic) functional VPTs is EXPTIME-C. Those problems are undecidable for PTs. Output words of VPTs are not necessarily well-nested. We identify a general subclass of VPTs that produce well-nested words, which is closed by composition, and for which the type checking problem is decidable.