Power properties of NLC graph grammars with a polynomial membership problem
type: Item
instance of: scholarly article
title: Power properties of NLC graph grammars with a polynomial membership problem
zbMATH Open document ID: 0911.68106
DOI: 10.1016/S0304-3975(97)00212-0
author: Mariusz Flasiński
published in: Theoretical Computer Science
publication date: 1998-08-13T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68N20
zbMATH DE Number: 1190162
zbMATH Keywords: graph grammars
zbMATH Keywords: graph parsing
zbMATH Keywords: membership problem
MaRDI profile type: Publication
cites work: Q3785993
cites work: Graph expressions and graph rewritings
cites work: Q3321473
cites work: Q3785989
cites work: Q4694748
cites work: First Order Graph Grammars
cites work: Context-free graph grammars
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: Q1839237
cites work: Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
cites work: Nonterminal bounded NLC graph grammars
cites work: Linear graph grammars: Power and complexity
cites work: Q3785994
cites work: Q4037292
cites work: Plex languages
cites work: Parsing of edNLC-graph grammars for scene analysis
cites work: Use of graph grammars for the description of mechanical parts
cites work: A class of linearly parsable graph grammars
cites work: Q3670607
cites work: Q3785988
cites work: On the structure of node-label-controlled graph languages
cites work: Graph grammars with neighbourhood-controlled embedding
cites work: Q3673132
cites work: On sequential and parallel node-rewriting graph grammars
cites work: Q3785992
cites work: Q3673138
cites work: Q3795250
cites work: Syntax-Directed Transduction
cites work: Separable graphs, planar graphs and web grammars
cites work: Q3666286
cites work: Pair grammars, graph languages and string-to-graph translations
cites work: Q5674993
cites work: Properties of deterministic top-down grammars
cites work: Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
cites work: Parsing and Translation of (Attributed) Expansive Graph Languages for Scene Analysis
cites work: Context-free grammars as a tool for describing polynomial-time subclasses of hard problems
cites work: Q3219131
cites work: Q3221428
description: scientific article; zbMATH DE number 1190162