论文信息 - A Pumping lemma and the structure of derivations in the boundary NLC graph languages

A Pumping lemma and the structure of derivations in the boundary NLC graph languages

Abstract A pumping lemma is known in the NLC (node-label-controlled) graph languages [4]. However, the pumping lemma has an unnatural point at the first pumping, that is, zero time pumping is not allowed in the pumping lemma. We consider the boundary NLC (BNLC) languages [10]. Then, we obtain a pumping lemma without the unnatural point, similar to one for the NLC graph languages, using the Church-Rosser property of the BNLC graph grammars. We also construct the pumped graphs and provide a constructive proof for our pumping lemma. As a result, we provide the structure of derivations in the BNLC graph grammars and a role of the Church-Rosser property in the NLC graph grammars.

Koichi Yamazaki | Takeo Yaku

[1] Grzegorz Rozenberg,et al. Boundary NLC Graph Grammars-Basic Definitions, Normal Forms, and Complexity , 1986, Inf. Control..

[2] Frank Harary,et al. Graph Theory , 2016 .

[3] Andrzej Ehrenfeucht,et al. Restrictions on NLC Graph Grammars , 1984, Theor. Comput. Sci..

[4] Theodosios Pavlidis,et al. Linear and Context-Free Graph Grammars , 1972, JACM.

[5] Grzegorz Rozenberg,et al. The Bounded Degree Problem for NLC Grammars is Decidable , 1986, J. Comput. Syst. Sci..

[6] Koichi Yamazaki,et al. The generating power of the boundary NLC graph grammars , 1993, CSC '93.

[7] Grzegorz Rozenberg,et al. On the structure of node-label-controlled graph languages , 1980, Inf. Sci..

[8] Grzegorz Rozenberg,et al. Restrictions, extensions, and variations of NLC grammars , 1980, Inf. Sci..

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