Some examples of semi-rational DAG languages

Authors:
Jan Robert Menzel;Lutz Priese;Monika Schuth
Affiliations:
Fachbereich Informatik, Universität Koblenz-Landau, Germany;Fachbereich Informatik, Universität Koblenz-Landau, Germany;Fachbereich Informatik, Universität Koblenz-Landau, Germany
Venue:
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Year:
2006

Citing 5
Cited 1

Graph Grammars for distributed systems

Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science
Petri nets and their relation to graph grammars

Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science
A Comparison Between Petri-Nets and Graph Grammars

WG '80 Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science
A Graph Grammar Representation of Non-Sequential Processes

WG '80 Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science
Semi-rational sets of DAGs

DLT'05 Proceedings of the 9th international conference on Developments in Language Theory

Finite automata on unranked and unordered DAGs

DLT'07 Proceedings of the 11th international conference on Developments in language theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The class of semi-rational dag languages can be characterized by labeled Petri nets with ε-transitions, by rather simple leaf substituting tree grammars with additional non-local merge rules, or as a synchronization closure of Courcelles class of recognizable sets of unranked, unordered trees. However, no direct recognition by some magma is known. For a better understanding, we present here some examples of languages within and without the class of semi-rational dag languages.