Transition Graphs of Rewriting Systems over Unranked Trees 1st Edition by Christof Loding, Alex Spelten ISBN 9783540744566

Transition Graphs of Rewriting Systems over Unranked Trees 1st Edition by Christof Loding, Alex Spelten – Ebook PDF Instant Download/Delivery. 9783540744566
Full download Transition Graphs of Rewriting Systems over Unranked Trees 1st Edition after payment

Product details:

ISBN 10: 
ISBN 13: 9783540744566
Author: Christof Loding, Alex Spelten

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.

Transition Graphs of Rewriting Systems over Unranked Trees 1st Table of contents:

1 Introduction
2 Preliminaries
3 Partial Subtree Rewriting Systems
4 Subtree and Flat Prefix Rewriting Systems
5 Summary and Outlook

People also search for Transition Graphs of Rewriting Systems over Unranked Trees 1st:

    
transition graphs of rewriting systems over unranked trees
    
transforming graphs of exponential functions
    
transforming graphs of functions
    
transforming graphs of linear functions
    
transitions graphs