A hierarchy of eNCE families of graph languages
type: Item
instance of: scholarly article
title: A hierarchy of eNCE families of graph languages
zbMATH Open document ID: 0893.68089
DOI: 10.1016/S0304-3975(97)86542-5
author: Changwook Kim
published in: Theoretical Computer Science
publication date: 1998-06-30T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1170404
zbMATH Keywords: graph language
MaRDI profile type: Publication
cites work: The complexity of regular DNLC graph languages
cites work: On the membership problem for regular DNLC grammars
cites work: Nonterminal bounded NLC graph grammars
cites work: Linear graph grammars: Power and complexity
cites work: Complexity of boundary graph languages
cites work: Apex graph grammars and attribute grammars
cites work: Boundary graph grammars with dynamic edge relabeling
cites work: A comparison of boundary graph grammars and context-free hypergraph grammars
cites work: Q5592246
cites work: On the structure of node-label-controlled graph languages
cites work: Restrictions, extensions, and variations of NLC grammars
cites work: Graph grammars with neighbourhood-controlled embedding
cites work: On sequential and parallel node-rewriting graph grammars
cites work: Node replacement graph languages squeezed with chains, trees, and forests
cites work: String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
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
description: scientific article; zbMATH DE number 1170404