Representation and uniformization of algebraic transductions

Abstract This paper explores different means of representation for algebraic transductions, i.e., word relations realized by pushdown transducers. The relevance of this work lies more in its point of view rather than any particular result. We are aiming at giving specific techniques for obtaining, or perhaps explaining, decompositions of algebraic (and incidentally, rational) relations, relying solely on their “machine” definition rather than some complex algebraic apparatus. From this point of view, we are hoping to have demystified the heavy formalism employed in the present literature. Some of the novelties of our work are: the use of “stack languages” and “embeddings,” which eliminate the need of arbitrary context-free languages in our characterizations, the study of uniformizations for algebraic transductions and the use of the so-called stack transductions for exposing the anatomy of pushdown transducers.

• Type: Journal
• Year: 2007
• Where: ACTA
• Authors: Stavros Konstantinidis, Nicolae Santean, Sheng Yu
• Keywords: ACTA 2007, Algebraic Transductions, Complex Algebraic Apparatus, Word Relations