{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T11:45:49Z","timestamp":1648727149818},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1982,6,1]],"date-time":"1982-06-01T00:00:00Z","timestamp":391737600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1982,6]]},"DOI":"10.1007\/bf02249935","type":"journal-article","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T14:24:22Z","timestamp":1132669462000},"page":"89-112","source":"Crossref","is-referenced-by-count":13,"title":["On the generative power of sequential and parallel programmed graph grammars"],"prefix":"10.1007","volume":"29","author":[{"given":"H.","family":"Bunke","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02249935_CR1","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BFb0025717","volume":"73","author":"C. Bartini","year":"1979","unstructured":"Bartini, C.: Rewriting systems as a tool for relational data base design. Lect. Notes Comp. Sci.73, 139\u2013154 (1979).","journal-title":"Lect. Notes Comp. Sci."},{"key":"BF02249935_CR2","first-page":"57","volume":"10","author":"W. Brendel","year":"1977","unstructured":"Brendel, W., Bunke, H., Nagl, M.: Syntaxgesteuerte Programmierung und inkrementelle Compilation. Informatik-Fachberichte10, 57\u201374 (1977).","journal-title":"Informatik-Fachberichte"},{"key":"BF02249935_CR3","first-page":"3","volume":"12","author":"H. Bunke","year":"1979","unstructured":"Bunke, H.: Sequentielle und parallele Graph-Grammatiken. Arbeitsbericht des IMMD Erlangen12, 3 (1979).","journal-title":"Arbeitsbericht des IMMD Erlangen"},{"key":"BF02249935_CR4","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1080\/03081077608934737","volume":"3","author":"K. Culik II","year":"1976","unstructured":"Culik, K., II, Lindenmayer, A.: Parallel rewriting on graphs and multidimensional development. Int. Journ. of Gen. Syst.3, 53\u201366 (1976).","journal-title":"Int. Journ. of Gen. Syst."},{"key":"BF02249935_CR5","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/3-540-07141-5_223","volume":"26","author":"E. Denert","year":"1975","unstructured":"Denert, E., Franck, R., Streng, W.: PLAN2D-Toward a twodimensional programming language. Lect. Notes Comp. Sci.26, 202\u2013213 (1975).","journal-title":"Lect. Notes Comp. Sci."},{"key":"BF02249935_CR6","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0019-9958(78)90528-4","volume":"37","author":"P. Della Vigna","year":"1978","unstructured":"Della Vigna, P., Ghezzi, C.: Context-free graph grammars. Inf. Contr.37, 207\u2013233 (1978).","journal-title":"Inf. Contr."},{"key":"BF02249935_CR7","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/3-540-08442-8_91","volume":"56","author":"H. Ehrig","year":"1977","unstructured":"Ehrig, H.: Embedding theorems in the algebraic theory of graph-grammars. Lect. Notes Comp. Sci.56, 245\u2013255 (1977).","journal-title":"Lect. Notes Comp. Sci."},{"key":"BF02249935_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0025714","volume":"73","author":"H. Ehrig","year":"1979","unstructured":"Ehrig, H.: Introduction to the algebraic theory of graph grammars. Lect. Notes Comp. Sci.73, 1\u201369 (1979).","journal-title":"Lect. Notes Comp. Sci."},{"key":"BF02249935_CR9","first-page":"425","volume-title":"Automata, Languages, Development","author":"H. Ehrig","year":"1976","unstructured":"Ehrig, H., Kreowski, H.-J.: Parallel graph grammars, in: Automata, Languages, Development (Lindenmayer, A., Rozenberg, G., eds.), pp. 425\u2013442. Amsterdam: North-Holland 1976."},{"key":"BF02249935_CR10","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Pfender, H., Schneider, H.J.: Graph grammars: an algebraic approach. Proc., 14th Annual Conf. Switching a. Automata Theory, pp. 167\u2013180 (1973).","DOI":"10.1109\/SWAT.1973.11"},{"key":"BF02249935_CR11","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/BFb0025723","volume":"73","author":"A. L. Furtado","year":"1979","unstructured":"Furtado, A. L.: Transformation of data base structures. Lect. Notes Comp. Sci.73, 224\u2013236 (1979).","journal-title":"Lect. Notes Comp. Sci."},{"key":"BF02249935_CR12","first-page":"207","volume":"13","author":"H. G\u00f6ttler","year":"1979","unstructured":"G\u00f6ttler, H.: Semantical description by two-level graph-grammars for quasihierarchical graphs. Applied Comp. Sci.13, 207\u2013226 (1979).","journal-title":"Applied Comp. Sci."},{"key":"BF02249935_CR13","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BFb0025724","volume":"73","author":"E. Gr\u00f6tsch","year":"1979","unstructured":"Gr\u00f6tsch, E., Nagl, M.: Explicit versus implicit parallel rewriting on graphs. Lect. Notes Comp. Sci.73, 237\u2013254 (1979).","journal-title":"Lect. Notes Comp. Sci."},{"key":"BF02249935_CR14","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/BFb0025726","volume":"73","author":"H.-J. Kreowski","year":"1979","unstructured":"Kreowski, H.-J.: A pumping lemma for context-free graph languages. Lect. Notes Comp. Sci.73, 270\u2013283 (1979).","journal-title":"Lect. Notes Comp. Sci."},{"key":"BF02249935_CR15","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02252341","volume":"20","author":"L. S. Levy","year":"1978","unstructured":"Levy, L. S., Yueh, K.: On labelled graph grammars. Computing20, 109\u2013125 (1978).","journal-title":"Computing"},{"key":"BF02249935_CR16","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0019-9958(70)90135-X","volume":"16","author":"U. G. Montanari","year":"1970","unstructured":"Montanari, U. G.: Separable graphs, planar graphs and web grammars. Inf. Contr.16, 243\u2013267 (1970).","journal-title":"Inf. Contr."},{"key":"BF02249935_CR17","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/3-540-08442-8_80","volume":"56","author":"M. Nagl","year":"1977","unstructured":"Nagl, M.: On the relation between graph grammars and graph Lindenmayer-systems. Lect. Notes Comp. Sci.56, 142\u2013151 (1977).","journal-title":"Lect. Notes Comp. Sci."},{"key":"BF02249935_CR18","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02241984","volume":"16","author":"M. Nagl","year":"1976","unstructured":"Nagl, M.: Formal languages of labelled graphs. Computing16, 113\u2013137 (1976).","journal-title":"Computing"},{"key":"BF02249935_CR19","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/BFb0025715","volume":"73","author":"M. Nagl","year":"1979","unstructured":"Nagl, M.: A tutorial and bibliographical survey on graph grammars. Lect. Notes Comp. Sci.73, 70\u2013126 (1979).","journal-title":"Lect. Notes Comp. Sci."},{"key":"BF02249935_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-01443-0","volume-title":"Graph-Grammatiken: Theorie, Anwendungen, Implementierung","author":"M. Nagl","year":"1979","unstructured":"Nagl, M.: Graph-Grammatiken: Theorie, Anwendungen, Implementierung. Wiesbaden: Vieweg-Verlag 1979."},{"key":"BF02249935_CR21","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321679.321682","volume":"19","author":"T. Pavlidis","year":"1972","unstructured":"Pavlidis, T.: Linear and context-free graph-grammars. JACM19, 11\u201323 (1972).","journal-title":"JACM"},{"key":"BF02249935_CR22","unstructured":"Pfaltz, J. L., Rosenfeld, A.: Web grammars. Proc. 1 st Int. Joint Conf. Art. Intell., Washington, 609\u2013619 (1969)."},{"key":"BF02249935_CR23","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1016\/S0022-0000(71)80016-8","volume":"5","author":"T. Pratt","year":"1971","unstructured":"Pratt, T.: Pair graphs, graph languages and string-to-graph translations. Journ. Comp. Syst. Sci.5, 560\u2013595 (1971).","journal-title":"Journ. Comp. Syst. Sci."},{"key":"BF02249935_CR24","first-page":"281","volume":"6","author":"A. Rosenfeld","year":"1971","unstructured":"Rosenfeld, A.: Isotonic grammars, parallel grammars, and picture grammars. Mach. Intell.6, 281\u2013294 (1971).","journal-title":"Mach. Intell."},{"key":"BF02249935_CR25","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/321495.321504","volume":"16","author":"D. J. Rosenkrantz","year":"1969","unstructured":"Rosenkrantz, D. J.: Programmed grammars and classes of formal languages. JACM16, 107\u2013131 (1969).","journal-title":"JACM"},{"key":"BF02249935_CR26","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/978-3-642-80732-9_9","volume":"78","author":"H. J. Schneider","year":"1972","unstructured":"Schneider, H. J.: A necessary and sufficient condition for Chomsky-productions over partially ordered symbol sets. Lect. Notes in Econ. and Math. Syst.78, 90\u201398 (1972).","journal-title":"Lect. Notes in Econ. and Math. Syst."},{"key":"BF02249935_CR27","first-page":"77","volume":"13","author":"H. J. Schneider","year":"1979","unstructured":"Schneider, H. J.: Conceptual data base description using graph grammars. Applied Comp. Sci.13, 77\u201398 (1979).","journal-title":"Applied Comp. Sci."},{"key":"BF02249935_CR28","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/3-540-08442-8_99","volume":"56","author":"H. J. Schneider","year":"1977","unstructured":"Schneider, H. J.: Graph grammars. Lect. Notes Comp. Sci.56, 314\u2013331 (1977).","journal-title":"Lect. Notes Comp. Sci."},{"key":"BF02249935_CR29","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00288659","volume":"6","author":"H. J. Schneider","year":"1976","unstructured":"Schneider, H. J., Ehrig, H.: Grammars on partial graphs. Acta Informatica6, 297\u2013316 (1976).","journal-title":"Acta Informatica"},{"key":"BF02249935_CR30","volume-title":"Tech. Report KFK-PDV 1","author":"K. H. Timmesfeld","year":"1973","unstructured":"Timmesfeld, K. H., et al.: PEARL \u2014 a proposal for a process- and experiment automation realtime language. Tech. Report KFK-PDV 1, Gesellschaft f\u00fcr Kernforschung, Karlsruhe, 1973."},{"key":"BF02249935_CR31","doi-asserted-by":"crossref","first-page":"11","DOI":"10.21099\/tkbjm\/1496158502","volume":"2","author":"T. Uesu","year":"1978","unstructured":"Uesu, T.: A system of graph grammars which generates all recursively enumerable sets of labelled graphs. Tsukuba Journ. Math.2, 11\u201326 (1978).","journal-title":"Tsukuba Journ. Math."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02249935.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02249935\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02249935","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T17:35:30Z","timestamp":1557941730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02249935"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,6]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,6]]}},"alternative-id":["BF02249935"],"URL":"https:\/\/doi.org\/10.1007\/bf02249935","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,6]]}}}