Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 24, Number 3, 1990
Page(s) 267 - 274
DOI https://doi.org/10.1051/ita/1990240302671
Published online 01 February 2017
  1. 1. IJ. J. AALBERSBERG, J. ENGELFRIET and G. ROZENBERG, The Complexity of Regular DNLC Graph Languages, Report 86-03, Leiden, April 1986, JCSS (to appear). [MR: 1056583] [Zbl: 0694.68045] [Google Scholar]
  2. 2. J. ENGELFRIET and G. LEIH, Linear Graph Grammars: Power and Complexity, Information and Computation, 81, 1989, pp. 88-121. [MR: 992305] [Zbl: 0684.68088] [Google Scholar]
  3. 3. J. ENGELFRIET, G. LEIH and G. ROZENBERG, Apex Graph Grammars, in Graph-Grammars and their Application to Computer Science, H. EHRIG, M. NAGL, G. ROZENBERG and A. ROSENFELD Eds., Lecture Notes in Computer Science, 291, Springer-Verlag, Berlin, 1987, pp. 167-185. [MR: 943173] [Zbl: 0643.68112] [Google Scholar]
  4. 4. J. ENGELFRIET, G. LEIH and E. WELZL, Boundary Graph Grammars with Dynamic Edge Relabeling, Report 87-30, Leiden, December 1987, J. Comput. System Sci. (to appear). [MR: 1056581] [Zbl: 0694.68049] [Google Scholar]
  5. 5. J. ENGELFRIET and G. ROZENBERG, A Comparison of Boundary Graph Grammars and Context-Free Hypergraph Grammars, Information and Computation, 84, 1990, pp. 163-206. [MR: 1035865] [Zbl: 0706.68067] [Google Scholar]
  6. 6. N. IMMERMANN, Nondeterministic Space is Closed Under Complement, Yale University, Technical Report, YALEU/DCS/TR 552, July 1987. [MR: 961049] [Google Scholar]
  7. 7. D. JANSSENS and G. ROZENBERG, On the Structure of Node-Label-Controlled Graph Languages, Information Sciences, 20, 1980, pp. 191-216. [MR: 563981] [Zbl: 0452.68073] [Google Scholar]
  8. 8. D. JANSSENS and G. ROZENBERG, Graph Grammars with Neighbourhood-Controlled Embedding, Theor. Comp. Science, 21, 1982, pp. 55-74. [MR: 672102] [Zbl: 0486.68075] [Google Scholar]
  9. 9. D. JANSSENS, G. ROZENBERG and R. VERRAEDT, On Sequential and Parallel Node-Rewriting Graph Grammars, Computer Graphics and Image Processing, 18, 1982, pp. 279-304. [Zbl: 0531.68030] [Google Scholar]
  10. 10. M. KAUL, Syntaxanalyse von Graphen bei Präzedenz-Graph-Grammatiken, Dissertation, Universität Osnabrück, 1985. [Zbl: 0587.68076] [Google Scholar]
  11. 11. C. LAUTEMANN, Efficient Algorithms on Context-Free Graph Languages, in Proc. 15th I.C.A.L.P., T. LEPISTÖ and A. SALOMMA Eds., Lecture Notes in Computer Science, 317, Springer-Verlag, Berlin, 1988, pp. 362-378. [MR: 1023648] [Zbl: 0649.68075] [Google Scholar]
  12. 12. G. ROZENBERG and E. WELZL, Boundary NLC Graph Grammars-Basic Definitions, Normal Forms, and Complexity, Inform. Contr., Vol. 69, 1986, pp. 136-167. [MR: 848438] [Zbl: 0608.68060] [Google Scholar]
  13. 13. W. L. Ruzzo, Tree-Size Bounded Alternation, J.C.S.S., 21, 1980, pp. 218-235. [MR: 597795] [Zbl: 0445.68034] [Google Scholar]
  14. 14. I. H. SUDBOROUGH, On the Tape Complexity of Deterministic Context-Free Languages, J.A.C.M., Vol. 25, 1978, pp. 405-414. [MR: 498563] [Zbl: 0379.68054] [Google Scholar]
  15. 15. R. SZELEPCSÉNYI, The Method of Forcing for Nondeterministic Automata Bulletin of the E.A.T.C.S., Vol. 33, 1987, pp. 96-99. [Zbl: 0664.68082] [Google Scholar]
  16. 16. E. WELZL, Boundary NLC and Partition Controlled Graph Grammars, in "Graph-Grammars and their Application to Computer Science", H. EHRIG M. NAGL, G. ROZENBERG and A. ROSENFELD Eds., Lecture Notes in Computer Science, 291, Springer-Verlag, Berlin, 1987, pp. 593-609. [MR: 943182] [Zbl: 0643.68109] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.