Normalization of sequential top-down tree-to-word transducers

Authors:
Grégoire Laurence;Aurélien Lemay;Joachim Niehren;Sławek Staworko;Marc Tommasi
Affiliations:
Mostrare project, INRIA & LIFL, CNRS UMR8022 and University of Lille, France;Mostrare project, INRIA & LIFL, CNRS UMR8022 and University of Lille, France;Mostrare project, INRIA & LIFL, CNRS UMR8022 and INRIA, Lille, France;Mostrare project, INRIA & LIFL, CNRS UMR8022 and University of Lille, France;Mostrare project, INRIA & LIFL, CNRS UMR8022 and University of Lille, France
Venue:
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Year:
2011

Citing 11
Cited 1

The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines

Journal of the ACM (JACM)
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Minimizing subsequential transducers: a survey

Theoretical Computer Science
Typechecking top-down XML transformations: Fixed input or output schemas

Information and Computation
Visibly Pushdown Transducers

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Deciding equivalence of top--down XML transformations in polynomial time

Journal of Computer and System Sciences
Equivalence of deterministic nested word to word transducers

FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
A learning algorithm for top-down XML transformations

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Minimization of deterministic bottom-up tree transducers

DLT'10 Proceedings of the 14th 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
Congruences for visibly pushdown languages

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Symbolic tree transducers

PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study normalization of deterministic sequential top-down tree-to-word transducers (stws), that capture the class of deterministic top-down nested-word to word transducers. We identify the subclass of earliest stws (estws) that yield unique normal forms when minimized. The main result of this paper is an effective normalization procedure for stws. It consists of two stages: we first convert a given stw to an equivalent estw, and then, we minimize the estw.