Computing with Graph Rewriting Systems with Priorities

Abstract In this paper, the computational power of the noetherian graph rewriting systems with priorities (PGRSs) is studied. We define the notion of safe PGRS with respect to a given property. The PGRSs are considered as recognizers for sets of graphs (1-graphs). The classes of sets of graphs (1-graphs) so defined are compared with the classes definable by logic formulas. We end with the particular cases of trees and words.

[1]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[2]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.

[3]  Neil Immerman,et al.  Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

[4]  W. T. Tutte.  Graph Theory , 1984 .

[5]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[6]  Yves Métivier,et al.  Computing trees with graph rewriting systems with priorities , 1992, Tree Automata and Languages.

[7]  Bruno Courcelle,et al.  The Monadic Second order Logic of Graphs VI: on Several Representations of Graphs By Relational Structures , 1994, Discret. Appl. Math..

[8]  H. Gaifman.  On Local and Non-Local Properties , 1982 .

[9]  John Doner,et al.  Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..

[10]  Ivan Fris,et al.  Grammars with Partial Ordering of the Rules , 1968, Inf. Control..

[11]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs V: On Closing the Gap Between Definability and Recognizability , 1991, Theor. Comput. Sci..

[12]  Jeffrey D. Ullman,et al.  Some Results on Tape-Bounded Turing Machines , 1969, JACM.

[13]  Ann Yasuhara,et al.  Recursive function theory and logic , 1971, Computer science and applied mathematics.

[14]  N. M. Nagorny,et al.  The Theory of Algorithms , 1988 .

[15]  Michel Billaud,et al.  Graph Rewriting Systems with Priorities , 1989, WG.