Name
Abstract | ||
|---|---|---|
We call a set of DAGs (directed acyclic graphs) semi-rational if it is accepted by a Petri net. It is shown that the class of semi-rational sets of DAGs coincides with the synchronization closure of Courcelles class of recognizable sets of unranked, unordered trees (or forests). |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11505877_34 | Developments in Language Theory |
Keywords | Field | DocType |
recognizable set,acyclic graph,courcelles class,semi-rational set,unordered tree,synchronization closure,petri net,directed acyclic graph | Discrete mathematics,Combinatorics,Synchronization,Petri net,Computer science,Directed graph,Directed acyclic graph,Philosophy of language,Tree automaton,Transitive closure | Conference |
Volume | ISSN | ISBN |
3572 | 0302-9743 | 3-540-26546-5 |
Citations | PageRank | References |
3 | 0.42 | 8 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lutz Priese | 1 | 240 | 31.41 |