Boundary graph grammars with dynamic edge relabeling (Q909478): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q54309721, #quickstatements; #temporary_batch_1711439739529
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic definition of context-free rewriting and its application to NLC 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. 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: Linear graph grammars: Power and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonterminal bounded NLC graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Apex graph grammars and attribute grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4179852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characteristics of graph languages generated by edge replacement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3904060 / 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: Restrictions, extensions, and variations of NLC grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of context-free string languages by directed node- label controlled graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph grammars with neighbourhood-controlled embedding / 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: Q3714485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3666286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674993 / 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: Graph theoretic closure properties of the family of boundary NLC graph languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial properties of boundary NLC graph languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing derivation trees of context-free grammars through a generalization of finite automata theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221428 / rank
 
Normal rank

Latest revision as of 12:32, 20 June 2024

scientific article
Language Label Description Also known as
English
Boundary graph grammars with dynamic edge relabeling
scientific article

    Statements

    Boundary graph grammars with dynamic edge relabeling (English)
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    context-freeness
    0 references
    graph grammars
    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