Name
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11779148_32 | Developments in Language Theory |
Keywords | Field | DocType |
recognizable set,courcelles class,semi-rational dag language,petri net,tree grammar,better understanding,additional non-local,direct recognition,synchronization closure,simple leaf | Synchronization,Programming language,Petri net,Computer science,Abstract family of languages,Tree grammars,Theoretical computer science,Grammar,Cone (formal languages),Tree automaton,Merge (version control) | Conference |
Volume | ISSN | ISBN |
4036 | 0302-9743 | 3-540-35428-X |
Citations | PageRank | References |
1 | 0.37 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jan Robert Menzel | 1 | 1 | 0.37 |
| Lutz Priese | 2 | 240 | 31.41 |
| Monika Schuth | 3 | 1 | 0.37 |