Paper Info
Title
Seperation results for separated apex NLC and NCE graph languages
Abstract
Relations among various types of node replacement graph languages are known in the literature but there has remained a gap in the hierarchy of these graph languages. The present paper fills this gap by proving a separation result for k -separated apex graph languages and by extending a known result for k -separated graph languages. This yields, together with other known relations, a complete hierarchy of NLC, NCE, eNCE graph languages and their k -separated, linear, and/or apex subclasses.
Year
DOI
Venue
2001
10.1006/jcss.2001.1749
J. Comput. Syst. Sci.
Keywords
Field
DocType
separation results,formal languages,node replacement systems,nce graph language,graph grammars,separated apex,seperation result,hierarchy,formal language
Discrete mathematics,Combinatorics,Graph property,Graph labeling,Directed graph,Null graph,Graph rewriting,Apex graph,Mathematics,Graph (abstract data type),Voltage graph
Journal
Volume
Issue
ISSN
62
4
Journal of Computer and System Sciences
Citations 
PageRank 
References 
1
0.35
21
Authors
1
Name
Order
Citations
PageRank
Changwook Kim110911.88