论文信息 - Graph grammars with node-label controlled rewriting and embedding - 字舞流文

Graph grammars with node-label controlled rewriting and embedding

Grzegorz Rozenberg | Dirk Janssens | G. Rozenberg | D. Janssens

[1] Grzegorz Rozenberg,et al. Graph Grammars with Neighbourhood-Controlled Embedding , 1982, Theor. Comput. Sci..

[2] Grzegorz Rozenberg,et al. On sequential and parallel node-rewriting graph grammars , 1982, Comput. Graph. Image Process..

[3] Grzegorz Rozenberg,et al. Decision Problems for Node Label Controlled Graph Grammars , 1981, J. Comput. Syst. Sci..

[4] Grzegorz Rozenberg,et al. On the structure of node-label-controlled graph languages , 1980, Inf. Sci..

[5] Grzegorz Rozenberg,et al. Restrictions, extensions, and variations of NLC grammars , 1980, Inf. Sci..

[6] Grzegorz Rozenberg,et al. The mathematical theory of L systems , 1980 .

[7] Hartmut Ehrig,et al. Introduction to the Algebraic Theory of Graph Grammars (A Survey) , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

[8] Hartmut Ehrig,et al. Graph-Grammars and Their Application to Computer Science and Biology , 1978, Lecture Notes in Computer Science.

[9] Hartmut Ehrig,et al. Parallelism of Manipulations in Multidimensional Information Structures , 1976, MFCS.

[10] A. Lindenmayer,et al. PARALLEL GRAPH GENERATING AND GRAPH RECURRENCE SYSTEMS FOR MULTICELLULAR DEVELOPMENT , 1976 .