Paper Info
Title
The generating power of the boundary NLC graph grammars
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.
Year
DOI
Venue
1993
10.1145/170791.170883
ACM Conference on Computer Science
Keywords
Field
DocType
nlc language,generating power,graph language,bnlc graph language,single label,bnlc language,class lc,boundary nlc graph grammar,cycle graph
Combinatorics,Comparability graph,Line graph,Graph power,Computer science,Algorithm,Theoretical computer science,Cograph,Symmetric graph,Universal graph,Voltage graph,Complement graph
Conference
ISBN
Citations 
PageRank 
0-89791-558-5
1
0.41
References 
Authors
7
1
Name
Order
Citations
PageRank
Koichi Yamazaki122221.85