Separating \(k\)-separated eNCE graph languages
type: Item
instance of: scholarly article
title: Separating \(k\)-separated eNCE graph languages
zbMATH Open document ID: 0801.68107
DOI: 10.1016/0304-3975(93)90290-A
author: V. Pereyra
published in: Theoretical Computer Science
publication date: 1994-11-29T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 501181
zbMATH Keywords: eNCE graph grammar
zbMATH Keywords: graph languages
MaRDI profile type: Publication
cites work: Graph expressions and graph rewritings
cites work: An axiomatic definition of context-free rewriting and its application to NLC graph grammars
cites work: Handle-rewriting hypergraph grammars
cites work: Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings
cites work: Q1839237
cites work: Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
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: Nonterminal separation in graph 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: Q3774975
cites work: On the structure of node-label-controlled graph languages
cites work: Restrictions, extensions, and variations of NLC grammars
cites work: Decision problems for node label controlled graph grammars
cites work: Graph grammars with neighbourhood-controlled embedding
cites work: Neighborhood-uniform NLC grammars
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: Combinatorial properties of boundary NLC graph languages
Recommended article: Nonterminal separation in graph grammars
Recommended article: Mathematical Foundations of Computer Science 2005
Recommended article: Q5746007
Recommended article: Q4737680
Recommended article: Complexity of boundary graph languages
Recommended article: A hierarchy of eNCE families of graph languages
Recommended article: On the separation question for tree languages
Recommended article: On the structure of recognizable languages of dependence graphs
Recommended article: Characterization of languages that can be represented by vertex-labeled graphs
description: scientific article; zbMATH DE number 501181