Power Properties of NLC Graph Grammars with a Polynomial Membership Problem

Mariusz Flasinski. Power Properties of NLC Graph Grammars with a Polynomial Membership Problem. Theoretical Computer Science, 201(1-2):189-231, 1998. [doi]

@article{Flasinski98,
  title = {Power Properties of NLC Graph Grammars with a Polynomial Membership Problem},
  author = {Mariusz Flasinski},
  year = {1998},
  doi = {10.1016/S0304-3975(97)00212-0},
  url = {http://dx.doi.org/10.1016/S0304-3975(97)00212-0},
  tags = {graph-rewriting, rewriting, grammar},
  researchr = {https://researchr.org/publication/Flasinski98},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {201},
  number = {1-2},
  pages = {189-231},
}