Composition of Path Transductions

We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutions and graph products. When graphs are considered as automata, path transductions correspond to rational word transductions on the accepted languages. They define strict subclasses of monadic transductions and preserve the decidability of monadic second order theory. We give a generalization of the Elgot and Mezei composition theorem from rational word transductions to path transductions.

• Type: Conference
• Year: 2004
• Where: GG
• Authors: Tanguy Urvoy
• Keywords: GG 2004, Graph Transformations, Path Transductions, Rational Word Transductions, Theoretical Computer Science