Computing with graph rewriting systems with priorities
From MaRDI portal
Publication:1261464
DOI10.1016/0304-3975(93)90116-BzbMath0777.68055OpenAlexW1983037164MaRDI QIDQ1261464
Publication date: 20 December 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(93)90116-b
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)
Related Items (6)
Proving convergence of self-stabilizing systems using first-order rewriting and regular languages ⋮ On the interleaving semantics of transformation units — A step into GRACE ⋮ Visualization of Distributed Algorithms Based on Graph Relabelling Systems1 1This work has been supported by the European TMR research network GETGRATS, and by the “Conseil Régional d' Aquitane”. ⋮ Graph Relabelling Systems ⋮ Checking Global Graph Properties by Means of Local Computations: the Majority Problem ⋮ The Kronecker product and local computations in graphs
Cites Work
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
- Tree acceptors and some of their applications
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The theory of algorithms
- Languages that Capture Complexity Classes
- Grammars with partial ordering of the rules
- Some Results on Tape-Bounded Turing Machines
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computing with graph rewriting systems with priorities
