Abstract
We introduce top-down deterministic transducers with rational lookahead (transducer for short) working on infinite terms. We show that for such a transducer T, there exists an MSO-transduction T such that for any graph G, unfold(T(G)) = T̃(unfold(G)). Reciprocally, we show that if an MSO-transduction T "preserves bisimilarity", then there is a transducer T̃ such that for any graph G, unfold(T(G)) = T̃(unfold(G)). According to this, transducers can be seen as a complete method of implementation of MSO-transductions that preserve bisimilarity. One application is for transformations of equational systems. © Springer-Verlag 2004.
Cite
CITATION STYLE
Colcombet, T., & Löding, C. (2004). On the expressiveness of deterministic transducers over infinite trees. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2996, 428–439. https://doi.org/10.1007/978-3-540-24749-4_38
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
