Loading...
Please wait, while we are loading the content...
Similar Documents
Electronic Communications of the EASST Volume 61 ( 2013 ) Selected Revised Papers from the 4 th International Workshop on Graph Computation Models ( GCM 2012 ) Derivation Languages of Graph Grammars
| Content Provider | Semantic Scholar |
|---|---|
| Author | Flick, Nils Erik |
| Copyright Year | 2013 |
| Abstract | We investigate sequential derivation languages associated with graph grammars, as a loose generalisation of free-labeled Petri nets and Szilard languages. The grammars are used to output strings of rule labels, and the applicability of a special rule determines the acceptance of a preceding derivation. Due to the great power of such grammars, this family of languages is quite large and endowed with many closure properties. All derivation languages are decidable in nondeterministic polynomial time and space O(n logn), by simulation of the graph grammar on a Turing machine. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://journal.ub.tu-berlin.de/eceasst/article/download/829/824 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
