Visibly Pushdown Transducers

Authors:
Jean-François Raskin;Frédéric Servais
Affiliations:
Computer Science Department, ,;Department of Computer & Decision Engineering (CoDE), Universitééé Libre de Bruxelles (U.L.B.),
Venue:
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Year:
2008

Citing 9
Cited 9

Typechecking for XML transformers

PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Typechecking Top-Down Uniform Unranked Tree Transducers

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Beyond Regular Model Checking

FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Regular Model Checking

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Visibly pushdown languages

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
XML type checking with macro tree transducers

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Marrying words and trees

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Visibly pushdown transducers for approximate validation of streaming XML

FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Adding nesting structure to words

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory

Properties of visibly pushdown transducers

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
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
XEvolve: an XML schema evolution framework

Proceedings of the 2011 ACM Symposium on Applied Computing
Evolving schemas for streaming XML

Theoretical Computer Science
Normalization of sequential top-down tree-to-word transducers

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Evolving schemas for streaming XML

FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
Bounded repairability for regular tree languages

Proceedings of the 15th International Conference on Database Theory
A uniformization theorem for nested word to word transductions

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

Visibly pushdown automata have been recently introduced by Alur and Madhusudan as a subclass of pushdown automata. This class enjoys nice properties such as closure under all Boolean operations and the decidability of language inclusion. Along the same line, we introduce here visibly pushdown transducers as a subclass of pushdown transducers. We study properties of those transducers and identify subclasses with useful properties like decidability of type checking as well as preservation of regularity of visibly pushdown languages.