The generating power of boundary NLC graph grammars and cycle graphs
type: Item
instance of: scholarly article
title: The generating power of boundary NLC graph grammars and cycle graphs
zbMATH Open document ID: 0820.68068
DOI: 10.1016/0020-0255(94)90061-2
author: Koichi Yamazaki
published in: Information Sciences
publication date: 1995-08-27T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 694924
zbMATH Keywords: graph grammar
zbMATH Keywords: graph language
MaRDI profile type: Publication
full work available at URL: 0020-0255(94)90061-2
OpenAlex ID: W2034838383
cites work: Restrictions on NLC graph grammars
cites work: Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings
cites work: On the structure of node-label-controlled graph languages
cites work: Restrictions, extensions, and variations of NLC grammars
cites work: Parallel concepts in graph theory
cites work: Q5592246
cites work: The bounded degree problem for NLC grammars is decidable
cites work: Linear and Context-Free Graph Grammars
cites work: Q5674993
cites work: Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
cites work: Graph theoretic closure properties of the family of boundary NLC graph languages
cites work: A pumping lemma and the structure of derivations in the boundary NLC graph languages
description: scientific article; zbMATH DE number 694924