Transition Graphs of Rewriting Systems over Unranked Trees

@inproceedings{Lding2007TransitionGO,
  title={Transition Graphs of Rewriting Systems over Unranked Trees},
  author={Christof L{\"o}ding and Alex Spelten},
  booktitle={MFCS},
  year={2007}
}
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 (binary) 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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Similar Papers

Loading similar papers…