Power Properties of NLC Graph Grammars with a Polynomial Membership Problem

@article{Flasinski1998PowerPO,
  title={Power Properties of NLC Graph Grammars with a Polynomial Membership Problem},
  author={Mariusz Flasinski},
  journal={Theor. Comput. Sci.},
  year={1998},
  volume={201},
  pages={189-231}
}
A research into syntax analysis of node label controlled (NLC) graph grammars (introduced and investigated in Janssens and Rozenberg (1980) and Janssens et al. (1982) has resulted in defining their subclasses with a polynomial membership problem (Flasinski, 1988, 1989, 1993). Good complexity properties have been shown in the last referred paper by defining an efficient parsing algorithm, O(n’), for the so-called ETPL(k) subclass of NLC grammars. In this paper we investigate power properties of… CONTINUE READING
Highly Cited
This paper has 19 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 43 references

Further development of the ZEUS Expert System: computer science foundations of design, DESY Report 94-046

  • M. Flasiriski
  • Deutsches Elektronen Synchrotron,
  • 1994

Ohrenberg, ZEX - an expert system of ZEUS

  • U. Behrens, M. Flasinski, K. L. Hagge
  • IEEE Trans. Nucl. Sci
  • 1994

On the use of graph grammars for the control of a distributed software

  • M. Flasiriski, L. Kotulski
  • allocation, Comput. J
  • 1992

Similar Papers

Loading similar papers…