On the Expressiveness of Deterministic Transducers over Infinite Trees [chapter]

Thomas Colcombet, Christof Löding
2004 Lecture Notes in Computer Science  
We introduce top-down deterministic transducers with rational lookahead (transducer for short) working on infinite terms. We show that for such a transducer e T , there exists an MSO-transduction T such that for any graph G, unfold(T (G)) = e T (unfold (G)). Reciprocally, we show that if an MSO-transduction T "preserves bisimilarity", then there is a transducer e T such that for any graph G, unfold (T (G)) = e T (unfold(G)). According to this, transducers can be seen as a complete method of
more » ... ementation of MSO-transductions that preserve bisimilarity. One application is for transformations of equational systems.
doi:10.1007/978-3-540-24749-4_38 fatcat:4onayeweibgp7mo7py7cimzrdu