×

On labelled graph grammars. (English) Zbl 0376.68045


MSC:

68Q45 Formal languages and automata
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Abe, N., Mizumoto, M., Toyoda, J. I., Tanaka, K.: Web Grammars and Several Graphs. J. Comp. Syst. Sci.7, 37–65 (1973). · Zbl 0253.68013 · doi:10.1016/S0022-0000(73)80049-2
[2] Ehrig, H., Pfender, M., Schneider, H. J.: Graph Grammars – an Algebraic Approach. Proc. Conf. Switch. Automata. Theory1973, 167–180.
[3] Montanari, U. G.: Separable Graphs, Planar Graphs and Web Grammars. Inf. Contr.16, 243 to 267 (1970). · Zbl 0215.56103 · doi:10.1016/S0019-9958(70)90135-X
[4] Nagl, M.: Formal Languages of Labelled Graphs. Computing16, 113–137 (1976). · Zbl 0333.68054 · doi:10.1007/BF02241984
[5] Pfaltz, J. L., Rosenfeld, A.: Web Grammars. Proc. Int. Joint Conf. art. Int., 609–619, Washington 1969.
[6] Pratt, T. W.: Pair Grammars, Graph Languages and String-to-graph Translators. J. Comp. Syst. Sci.5, 560–595 (1971). · Zbl 0229.68029 · doi:10.1016/S0022-0000(71)80016-8
[7] Rosen, B. K.: Deriving Graphs from Graphs by Applying a Production. Acta Informatica4, 337–357 (1975). · Zbl 0306.68050 · doi:10.1007/BF00289616
[8] Rosenfeld, A., Milgram, D. L.: Web Automata and Web Grammars. Machine Intelligence7, 307–324 (1972). · Zbl 0259.68037
[9] Schneider, H. J., Ehrig, H.: Grammars on Partial Graphs. Acta Informatica6, 297–316 (1976). · Zbl 0329.68061 · doi:10.1007/BF00288659
[10] Nagl, M.: Graph Rewriting Systems and their Application in Biology, in Lecture Notes in Biomathematics, 11, p. 135–156. Berlin-Heidelberg-New York: Springer 1976. · Zbl 0334.92011
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.