Power properties of NLC graph grammars with a polynomial membership problem (Q1129012): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3785993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph expressions and graph rewritings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3321473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: First Order Graph Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-free graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrictions on NLC graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: 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'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonterminal bounded NLC graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear graph grammars: Power and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plex languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parsing of edNLC-graph grammars for scene analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Use of graph grammars for the description of mechanical parts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of linearly parsable graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3670607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of node-label-controlled graph languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph grammars with neighbourhood-controlled embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3673132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sequential and parallel node-rewriting graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3673138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntax-Directed Transduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separable graphs, planar graphs and web grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3666286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pair grammars, graph languages and string-to-graph translations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of deterministic top-down grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary NLC graph grammars—Basic definitions, normal forms, and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parsing and Translation of (Attributed) Expansive Graph Languages for Scene Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-free grammars as a tool for describing polynomial-time subclasses of hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221428 / rank
 
Normal rank

Latest revision as of 14:47, 28 May 2024

scientific article
Language Label Description Also known as
English
Power properties of NLC graph grammars with a polynomial membership problem
scientific article

    Statements

    Power properties of NLC graph grammars with a polynomial membership problem (English)
    0 references
    0 references
    13 August 1998
    0 references
    graph grammars
    0 references
    graph parsing
    0 references
    membership problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers