{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:46:04Z","timestamp":1725453964914},"publisher-location":"Berlin\/Heidelberg","reference-count":16,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540123105"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0000104","type":"book-chapter","created":{"date-parts":[[2005,10,5]],"date-time":"2005-10-05T10:17:45Z","timestamp":1128507465000},"page":"143-158","source":"Crossref","is-referenced-by-count":16,"title":["On context-free graph languages generated by edge replacement"],"prefix":"10.1007","author":[{"given":"Annegret","family":"Habel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans -J\u00f6rg","family":"Kreowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","volume-title":"Programs and Machines","author":"R. Bird","year":"1976","unstructured":"Bird, R.: Programs and Machines, Wiley, New York (1976)."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Claus, V., Ehrig, H., Rozenberg, G. (eds.): Graph-Grammars and their Application to Computer Science and Biology, Lect. Not. Comp. Sci.73 (1979)","DOI":"10.1007\/BFb0025713"},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0019-9958(78)90528-4","volume":"37","author":"P. Vigna Della","year":"1978","unstructured":"Della Vigna, P., Ghezzi, C.: Context-free Graph Grammars, Inf.Contr. 37, 207\u2013233 (1978)","journal-title":"Inf.Contr."},{"key":"10_CR4","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. Not. Comp. Sci. 73 (1979), 1\u201369","journal-title":"Lect. Not. Comp. Sci."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Farrow, R., Kennedy, K., Zucconi, L.: Graph Grammars and Global Program Data Flow Analysis; Proc. 17th Ann. Symp. on Found. of Comp. Sci., Houston (1976)","DOI":"10.1109\/SFCS.1976.17"},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1145\/321127.321132","volume":"9","author":"S. Ginsburg","year":"1962","unstructured":"Ginsburg, S., Rice, G.: Two Families of Languages Related to ALGOL, Journ. ACM, vol. 9, 350\u2013371 (1962)","journal-title":"Journ. ACM"},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/S0022-0000(71)80023-5","volume":"5","author":"J. Gruska","year":"1971","unstructured":"Gruska, J.: A Characterization of Context-free Languages, Journ. Comp. Syst. Sci. 5, 353\u2013364 (1971)","journal-title":"Journ. Comp. Syst. Sci."},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0020-0255(80)90038-9","volume":"20","author":"D. Janssens","year":"1980","unstructured":"Janssens, D., Rozenberg, G.: On the structure of node-label-controlled graph grammars; Information Science 20, 191\u2013216 (1980)","journal-title":"Information Science"},{"key":"10_CR9","unstructured":"Kaul, M.: Private Communication, 1982"},{"key":"10_CR10","volume-title":"Introduction to Meta Mathematics","author":"S.C. Kleene","year":"1952","unstructured":"Kleene, S.C.: Introduction to Meta Mathematics, D. Von Nostrand, Inc., Princeton, N.J. (1952)"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Kreowski, H.-J.: Manipulationen von Graphmanipulationen, Ph.D.Thesis, Techn. Univ. Berlin, Comp. Sci. Dept., 1977 (short version in LNCS 56 (1977), 275\u2013286)","DOI":"10.1007\/3-540-08442-8_94"},{"key":"10_CR12","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/BFb0025726","volume":"73","author":"H.-J. Kreowski","year":"1979","unstructured":"-: A Pumping Lemma for Context-free Graph Languages, Lect. Not. Comp. Sci. 73, (1979), 270\u2013283","journal-title":"Lect. Not. Comp. Sci."},{"key":"10_CR13","volume-title":"Mathematical Theory of Computation","author":"Z. Manna","year":"1974","unstructured":"Manna, Z.: Mathematical Theory of Computation; McGraw-Hill, New York (1974)"},{"key":"10_CR14","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. Not. Comp. Sci. 73 (1979), 70\u2013126","journal-title":"Lect. Not. Comp. Sci."},{"issue":"10","key":"10_CR15","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1145\/355598.362773","volume":"13","author":"W.A. Woods","year":"1970","unstructured":"Woods, W.A.: Transition Network Grammars for Natural Language Analysis, Comm. of the ACM 1970, 13(10), 591\u2013606","journal-title":"Comm. of the ACM"},{"key":"10_CR16","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0019-9958(71)90419-0","volume":"18","author":"M.K. Yntema","year":"1971","unstructured":"Yntema, M.K.: Cap Expressions for Context-Free Languages, Inf. Contr. 18 (1971), 311\u2013318","journal-title":"Inf. Contr."}],"container-title":["Lecture Notes in Computer Science","Graph-Grammars and Their Application to Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0000104.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T14:43:17Z","timestamp":1607352197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0000104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540123105"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0000104","relation":{},"subject":[]}}