Power properties of NLC graph grammars with a polynomial membership problem
From MaRDI portal
Publication:1129012
Recommendations
Cites work
- scientific article; zbMATH DE number 3885330 (Why is no real title available?)
- scientific article; zbMATH DE number 3888930 (Why is no real title available?)
- scientific article; zbMATH DE number 3852433 (Why is no real title available?)
- scientific article; zbMATH DE number 3819112 (Why is no real title available?)
- scientific article; zbMATH DE number 3825216 (Why is no real title available?)
- scientific article; zbMATH DE number 3827232 (Why is no real title available?)
- scientific article; zbMATH DE number 3827238 (Why is no real title available?)
- scientific article; zbMATH DE number 4049099 (Why is no real title available?)
- scientific article; zbMATH DE number 4049100 (Why is no real title available?)
- scientific article; zbMATH DE number 4049103 (Why is no real title available?)
- scientific article; zbMATH DE number 4049104 (Why is no real title available?)
- scientific article; zbMATH DE number 4049105 (Why is no real title available?)
- scientific article; zbMATH DE number 4060748 (Why is no real title available?)
- scientific article; zbMATH DE number 177419 (Why is no real title available?)
- scientific article; zbMATH DE number 219261 (Why is no real title available?)
- scientific article; zbMATH DE number 3410623 (Why is no real title available?)
- A class of linearly parsable 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
- Context-free graph grammars
- First Order Graph Grammars
- Graph expressions and graph rewritings
- Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings
- Graph grammars with neighbourhood-controlled embedding
- 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
- Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
- Linear graph grammars: Power and complexity
- Nonterminal bounded NLC graph grammars
- On sequential and parallel node-rewriting graph grammars
- On the structure of node-label-controlled graph languages
- Pair grammars, graph languages and string-to-graph translations
- Parsing and Translation of (Attributed) Expansive Graph Languages for Scene Analysis
- Parsing of edNLC-graph grammars for scene analysis
- Plex languages
- Properties of deterministic top-down grammars
- Restrictions on NLC graph grammars
- Separable graphs, planar graphs and web grammars
- Syntax-Directed Transduction
- Use of graph grammars for the description of mechanical parts
Cited in
(13)- scientific article; zbMATH DE number 3943061 (Why is no real title available?)
- scientific article; zbMATH DE number 4049102 (Why is no real title available?)
- scientific article; zbMATH DE number 3885330 (Why is no real title available?)
- Fundamental methodological issues of syntactic pattern recognition
- On the structure of linear apex NLC graph grammars
- 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
- Inference of parsable graph grammars for syntactic pattern recognition
- Characterizing compressibility of disjoint subgraphs with NLC grammars
- Algorithmic uses of the Feferman-Vaught theorem
- scientific article; zbMATH DE number 820122 (Why is no real title available?)
- Parsing of edNLC-graph grammars for scene analysis
- scientific article; zbMATH DE number 3872712 (Why is no real title available?)
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)
