Transition graphs of rewriting systems over unranked trees. (English) Zbl 1147.68546
Kučera, Luděk (ed.) et al., Mathematical foundations of computer science 2007. 32nd international symposium, MFCS 2007, Český Krumlov, Czech Republic, August 26–31, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74455-9/pbk). Lecture Notes in Computer Science 4708, 67-77 (2007).
Summary: 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.
For the entire collection see [Zbl 1143.68009].
For the entire collection see [Zbl 1143.68009].
MSC:
| 68Q42 | Grammars and rewriting systems |
| 68Q60 | Specification and verification (program logics, model checking, etc.) |
