The generating power of the boundary NLC graph grammars

Authors:
Koichi Yamazaki
Affiliations:
Department of Information Sciences, Tokyo Denki University, Hatoyama-Machi, Hiki-Gun, Saitama 350-03, Japan
Venue:
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Year:
1993

Citing 5
Cited 0

The bounded degree problem for NLC grammars is decidable

Journal of Computer and System Sciences
Boundary NLC graph grammars--basic definitions, normal forms, and complexity

Information and Control
Graph theoretic closure properties of the family of boundary NLC graph languages

Acta Informatica
Graph Grammars and Their Application to Computer Science: 4th International Workshop, Bremen, Germany, March 5-9, 1990 Proceedings

Graph Grammars and Their Application to Computer Science: 4th International Workshop, Bremen, Germany, March 5-9, 1990 Proceedings
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

It is known that Ga (Ga is the set of all graphs labeled by a single label a) is an NLC language [3, 1980], Ca (Ca is the set of all cycle graphs labeled by a single label a) is not an NLC language [1, 1984], and Ga is not a BNLC language [8, 1986]. In this paper, we consider the class Lc of all graph languages including Ca. We show that the class Lc and the class of BNLC graph languages are mutually disjoint. We note that Ca and Ga are elements of Lc.