Power properties of NLC graph grammars with a polynomial membership problem

Graph theory (including graph drawing) in computer science (68R10) Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Syntax-Directed Transduction
Properties of deterministic top-down grammars
On the structure of node-label-controlled graph languages
Graph grammars with neighbourhood-controlled embedding
Linear graph grammars: Power and complexity
On sequential and parallel node-rewriting graph grammars
Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
Context-free grammars as a tool for describing polynomial-time subclasses of hard problems
Pair grammars, graph languages and string-to-graph translations
Plex languages
Graph expressions and graph rewritings
Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings
Graph-grammars and their application to computer science. 2nd International Workshop, Haus Ohrbeck, Germany, October 4-8, 1982. Under the auspices of the European Association for Theoretical Computer Science
Parsing of edNLC-graph grammars for scene analysis
Parsing and Translation of (Attributed) Expansive Graph Languages for Scene Analysis
Restrictions on NLC graph grammars
Nonterminal bounded NLC graph grammars
A class of linearly parsable graph grammars
Context-free graph grammars
Use of graph grammars for the description of mechanical parts
First Order Graph Grammars
Separable graphs, planar graphs and web grammars

Cited In (5)

Algorithmic uses of the Feferman-Vaught theorem
On the structure of linear apex NLC graph grammars
Fundamental methodological issues of syntactic pattern recognition
Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
A polynomial algorithm for the membership problem with categorial grammars

This page was built for publication: Power properties of NLC graph grammars with a polynomial membership problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1129012)