Nonterminal Bounded NLC Graph Grammars

@article{Engelfriet1988NonterminalBN,
  title={Nonterminal Bounded NLC Graph Grammars},
  author={J. Engelfriet and George Leih},
  journal={Theor. Comput. Sci.},
  year={1988},
  volume={59},
  pages={309-315}
}
  • J. Engelfriet, George Leih
  • Published 1988
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • Il est montre que ces grammaires ne peuvent pas etre simulees par une grammaire graphe lineaire 
    7 Citations
    Graph Grammars Based on Node Rewriting: An Introduction to NLC Graph Grammars
    • 60
    Power Properties of NLC Graph Grammars with a Polynomial Membership Problem
    • M. Flasinski
    • Mathematics, Computer Science
    • Theor. Comput. Sci.
    • 1998
    • 45
    Node Replacement Graph Languages Squeezed with Chains, Trees, and Forests
    • 8
    Linear Graph Grammars: Power and Complexity
    • 48
    • PDF
    A Hierarchy of eNCE Families of Graph Languages
    • Changwook Kim
    • Computer Science, Mathematics
    • Theor. Comput. Sci.
    • 1997
    • 17
    Boundary Graph Grammars with Dynamic Edge Relabeling
    • 46
    Separation Results for Separated Apex NLC and NCE Graph Languages
    • Changwook Kim
    • Mathematics, Computer Science
    • J. Comput. Syst. Sci.
    • 2001
    • 2

    References

    SHOWING 1-4 OF 4 REFERENCES
    Apex Graph Grammars
    • 24
    On the structure of node-label-controlled graph languages
    • 160
    Linear Graph Grammars: Power and Complexity
    • 48
    • PDF
    Graph Grammars with Neighbourhood-Controlled Embedding
    • 84