We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. For the first, we construct a reduction to ranked trees via an encoding and to standard ground tree rewriting, thus showing that the generated classes of transition graphs coincide. In the second rewriting formalism, we use subtree rewriting combined with a new operation called flat prefix rewriting and show that strictly more transition graphs are obtained while the first-order theory with reachability relation remains decidable. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Löding, C., & Spelten, A. (2007). Transition graphs of rewriting systems over unranked trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4708 LNCS, pp. 67–77). Springer Verlag. https://doi.org/10.1007/978-3-540-74456-6_8
Mendeley helps you to discover research relevant for your work.