A uniformization theorem for nested word to word transductions

Authors:
Dmitry Chistikov;Rupak Majumdar
Affiliations:
Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern and Saarbrücken, Germany;Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern and Saarbrücken, Germany
Venue:
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Year:
2013

Citing 11
Cited 0

A construction on finite automata that has remained hidden

Theoretical Computer Science - Special issue: papers dedicated to the memory of Marcel-Paul Schützenberger
Automata, Languages, and Machines

Automata, Languages, and Machines
Representation and uniformization of algebraic transductions

Acta Informatica
Visibly Pushdown Transducers

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Adding nesting structure to words

Journal of the ACM (JACM)
Facets of Synthesis: Revisiting Church's Problem

FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Elements of Automata Theory

Elements of Automata Theory
Equivalence of deterministic nested word to word transducers

FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Properties of visibly pushdown transducers

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Adding nesting structure to words

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Visibly pushdown transducers with look-ahead

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the class of relations implemented by nested word to word transducers (also known as visibly pushdown transducers). We show that any such relation can be uniformized by a functional relation from the same class, implemented by an unambiguous transducer. We give an exponential upper bound on the state complexity of the uniformization, improving a previous doubly exponential upper bound. Our construction generalizes a classical construction by Schützenberger for the disambiguation of nondeterministic finite-state automata, using determinization and summarization constructions on nested word automata. Besides theoretical interest, our procedure can be the basis for synthesis procedures for nested word to word transductions.