Graph Rewriting Systems with Priorities

Authors:
Michel Billaud;Pierre Lafon;Yves Métivier;Eric Sopena
Affiliations:
-;-;-;-
Venue:
WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
1989

Citing 0
Cited 4

Termination Detection of Distributed Algorithms by Graph Relabelling Systems

ICGT '02 Proceedings of the First International Conference on Graph Transformation
Decision Problems for Semi-Thue Systems with a Few Rules

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Algebraic properties of processes for Local Action Systems

Mathematical Structures in Computer Science
EXPANDING GRAPH RELABELING SYSTEMS HAVE THE POWER OF RECURSIVE ENUMERABILITY

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract