Neighborhood-uniform NLC grammars

TLDR: This paper investigates the basic properties of the class of neighborhood-uniform nodel label controlled (NUNLC) graph grammars and demonstrates that a number of basic properties are decidable for theclass of NUNLC grammar—many of them are undecidable in the whole class of NLC Grammars.

Abstract: This paper investigates the basic properties of the class of neighborhood-uniform nodel label controlled (NUNLC) graph grammars The class of NUNLC grammars is distinguished by requiring a very natural restriction on the connection relations of NLC grammars The restriction implies “Church-Rosser property” of derivations in an NUNLC grammar, which makes the class of NUNLC grammars “technically easier” to investigate A number of combinatorial properties of the languages generated by the class of NUNLC grammars are proved Also, it is demonstrated that a number of basic properties are decidable for the class of NUNLC grammars—many of them are undecidable in the whole class of NLC grammars