论文信息 - Computing with Graph Relabelling Systems with Priorities

Computing with Graph Relabelling Systems with Priorities

In this paper, the computational power of the noetherian Graph Relabelling systems with Priorities (PGRS for short) is studied. The PGRS's are considered as recognizers for sets of graphs and for sets of 1-sourced graphs. We show that the PGRS's are strictly more powerful for the 1-sourced graphs than for the graphs. Furthermore every set of 1-sourced graphs definable in First Order Logic is recognizable by some PGRS.

Yves Métivier | Igor Litovsky | Y. Métivier | I. Litovsky

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

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

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

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

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

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

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

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

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

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