{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:44Z","timestamp":1725663284514},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540187714"},{"type":"electronic","value":"9783540481782"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18771-5_49","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:47:33Z","timestamp":1330199253000},"page":"112-132","source":"Crossref","is-referenced-by-count":10,"title":["A representation of graphs by algebraic expressions and its use for graph rewriting systems"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Courcelle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1051\/ita\/1978120302351","volume":"12","author":"A. Arnold","year":"1978","unstructured":"ARNOLD A., DAUCHET M., Th\u00e9orie des magmo\u00efdes, RAIRO Informatique th\u00e9orique 12 (1978) 235\u2013257.","journal-title":"RAIRO Informatique th\u00e9orique"},{"key":"10_CR2","unstructured":"BAUDERON M., COURCELLE B., Graph expressions and graph rewritings, Report I-8623, 1986, to appear in Math. Systems Theory (Also L.N.C.S. Vol.214 pp.74\u201384, Springer 1986)."},{"issue":"3","key":"10_CR3","first-page":"375","volume":"31","author":"S. Bloom","year":"1985","unstructured":"BLOOM S., ESIK Z., Axiomatizing schemes and their behaviors, J.C.S.S. vol. 31 no3 (1985) pp 375\u2013393.","journal-title":"J.C.S.S."},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B. Courcelle","year":"1983","unstructured":"COURCELLE B., Fundamental properties of infinite trees, Theor.Comp. Sci. 25(1983) 95\u2013169.","journal-title":"Theor.Comp. Sci."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(86)90050-2","volume":"46","author":"B. Courcelle","year":"1986","unstructured":"COURCELLE B., Equivalences and transformations of regular systems. Applications to recursive program schemes and grammars, Theor.Comp.Sci. 46 (1986), 1\u2013122.","journal-title":"Theor.Comp.Sci."},{"key":"10_CR6","unstructured":"COURCELLE B., Recognizability and second order definability for sets of finite graphs, Research report 8634 Bordeaux I University, 1986."},{"key":"10_CR7","unstructured":"COURCELLE B., On context-free sets of graphs and their monadic second-order theory, this volume."},{"key":"10_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 graphs Lect. Notes in Comp. Sci. 73, Springer 1979, 1\u201369.","journal-title":"Lect. Notes in Comp. Sci."},{"key":"10_CR9","unstructured":"EHRIG H. (ed.) Proceedings 1st International workshop on graph grammars, L.N.C.S. vol. 73, 1979."},{"key":"10_CR10","unstructured":"EHRIG H. (ed.), Proceedings 2nd International workshop on graph grammars, L.N.C.S. vol. 153, 1983."},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF01752403","volume":"14","author":"H. Ehrig","year":"1981","unstructured":"EHRIG H., KREOWSKI H.J., MAGGIOLO-SCHETTINI A., ROSEN B. WINKOWSKI J., Transformations of structures: An algebraic approach, Math. Systems Theory 14 (1981) 305\u2013334.","journal-title":"Math. Systems Theory"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"EHRIG H., MAHR B., Fundamental of algebraic specifications 1, EATCS monograph vol.6, Springer-Verlag 1985.","DOI":"10.1007\/978-3-642-69962-7"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"EHRIG H., PFENDER M., SCHNEIDER H., Graph grammars: an algebraic approach, Proc. 14th IEEE Symp. on Switching and automata theory, Iowa City, 1973 p. 167\u2013180.","DOI":"10.1109\/SWAT.1973.11"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"ELGOT C., Monadic computation and iterative algebraic theories, Proc. Logic Colloq. 73, North Holland, Pub. Co. Amsterdam 1975, 175\u2013230.","DOI":"10.1016\/S0049-237X(08)71949-9"},{"key":"10_CR15","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1145\/321127.321132","volume":"9","author":"S. Ginsburg","year":"1962","unstructured":"GINSBURG S., RICE, H., Two families of languages related to ALGOL, JACM 9 (1962) 350\u2013371.","journal-title":"JACM"},{"key":"10_CR16","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BFb0000104","volume":"153","author":"A. Habel","year":"1983","unstructured":"HABEL A. and KREOWSKI H.J, On context-free graph languages generated by edge replacements, Lec.Notes Comp.Sci. 153, Springer 1983, pp 143\u2013158.","journal-title":"Lec.Notes Comp.Sci."},{"key":"10_CR17","unstructured":"HABEL A. and KREOWSKI H.J, Some structural aspects of hypergraph languages generated by hyperedge replacements, Preprint, October 1985. Proc. STACS 1987. L.N.C.S. vol.247."},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"HUET G., OPPEN D., Equations and rewrite rules, a survey, in \"Formal languages, Perspectives and open problems\" R.Book ed. Academic Press 1980.","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"10_CR19","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0734-189X(86)90023-X","volume":"35","author":"D. Janssens","year":"1986","unstructured":"JANSSENS D., ROZENBERG G., Neighborhood uniform NLC grammars, Computer vision, graphics and image processing 35 (1986) 131\u2013151.","journal-title":"Computer vision, graphics and image processing"},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0019-9958(67)90353-1","volume":"11","author":"J. Mezei","year":"1967","unstructured":"MEZEI J., WRIGHT J., Algebraic automata and context-free sets, Information and control 11 (1967) 3\u201329.","journal-title":"Information and control"},{"key":"10_CR21","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/BFb0000123","volume":"153","author":"M. Nagl","year":"1983","unstructured":"NAGL M., Bibliography on graph-rewriting systems (graph grammars), Lec.Notes Comp.Sci. 153 Springer 1983, pp. 415\u2013448.","journal-title":"Lec.Notes Comp.Sci."},{"key":"10_CR22","first-page":"1034","volume":"39","author":"S. Petrov","year":"1978","unstructured":"PETROV S., Graph grammars and automata (survey), Automation and Remote Control 39 (1978) 1034\u20131050.","journal-title":"Automation and Remote Control"},{"key":"10_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(84)90021-5","volume":"32","author":"J.C. Raoult","year":"1984","unstructured":"RAOULT J.C., On graphs rewritings, Theor.Comp.Sci. 32 (1984) 1\u201324.","journal-title":"Theor.Comp.Sci."},{"key":"10_CR24","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF00289616","volume":"4","author":"B. Rosen","year":"1975","unstructured":"ROSEN B., Deriving graphs from graphs by applying a production, Acta Informatica 4 (1975) 337\u2013357.","journal-title":"Acta Informatica"},{"key":"10_CR25","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-12727-5_5","volume":"159","author":"G Rozenberg","year":"1983","unstructured":"ROZENBERG G, D. JANSSENS, A survey of NLC grammars, in Proc. CAAP' 83 L'Aquila, Lect. Notes in Comp. Sci. 159, Springer 1983, 114\u2013128.","journal-title":"Lect. Notes in Comp. Sci."},{"key":"10_CR26","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF00289115","volume":"23","author":"G. Rozenberg","year":"1986","unstructured":"ROZENBERG G., WELZL E., BNLC grammars: graph theoretic closure properties, Acta Informatica 23 (1986) 289\u2013309","journal-title":"Acta Informatica"},{"issue":"2","key":"10_CR27","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0022-0000(83)90038-7","volume":"27","author":"H. Schmeck","year":"1983","unstructured":"SCHMECK H., Algebraic characterization of reducible flow-charts, Journ. of Comp. and Syst. Sci. 27,2 (1983) 165\u2013199.","journal-title":"Journ. of Comp. and Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Graph-Grammars and Their Application to Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18771-5_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:18:13Z","timestamp":1619558293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18771-5_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540187714","9783540481782"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-18771-5_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}