{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:09Z","timestamp":1759638189178},"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_41","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T14:47:52Z","timestamp":1330181272000},"page":"15-26","source":"Crossref","is-referenced-by-count":59,"title":["May we introduce to you: Hyperedge 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","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/BFb0022660","volume":"214","author":"M. Bauderon","year":"1986","unstructured":"M. Bauderon, B. Courcelle: An Algebraic Formalism for Graphs, Lect. Not. Comp. Sci. 214, 74\u201384 (1986)","journal-title":"Lect. Not. Comp. Sci."},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0019-9958(78)90528-4","volume":"37","author":"P. Della Vigna","year":"1978","unstructured":"P. Della Vigna, C. Ghezzi: Context-free Graph Grammars, Inf. Contr. 37 (1978), 207\u2013233","journal-title":"Inf. Contr."},{"key":"2_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0025714","volume":"73","author":"H. Ehrig","year":"1979","unstructured":"H. Ehrig: Introduction to the Algebraic Theory of Graph Grammars, Lect. Not. Comp. Sci. 73, 1\u201369 (1979)","journal-title":"Lect. Not. Comp. Sci."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"R. Farrow, K. Kennedy, L. Zucconi: Graph Grammars and Global Program Data Flow Analysis, Proc. 17th Ann. IEEE Symp. on Found of Comp. Sci., Houston, Texas, Oct. 1976, 42\u201356","DOI":"10.1109\/SFCS.1976.17"},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0020-0255(71)80008-7","volume":"3","author":"J. Feder","year":"1971","unstructured":"J. Feder: Plex Languages, Inform. Sci. 3 (1971), 225\u2013241","journal-title":"Inform. Sci."},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF00289155","volume":"10","author":"R. Franck","year":"1978","unstructured":"R. Franck: A Class of Linearly Parsable Graph Grammars, Acta Informatica 10, 175\u2013201 (1978)","journal-title":"Acta Informatica"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/321127.321132","volume":"9","author":"S. Ginsburg","year":"1962","unstructured":"S. Ginsburg, G. Rice: Two Families of Languages Related to ALGOL, Journ. ACM, vol. 9 (1962), 350\u2013371","journal-title":"Journ. ACM"},{"key":"2_CR8","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/S0022-0000(71)80023-5","volume":"5","author":"J. Gruska","year":"1971","unstructured":"J. Gruska: A Characterization of Context-free Languages, Journ. Comp. Syst. Sci. 5 (1971), 353\u2013364","journal-title":"Journ. Comp. Syst. Sci."},{"key":"2_CR9","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BFb0000104","volume":"153","author":"A. Habel","year":"1983","unstructured":"A. Habel, H.-J. Kreowski: On Context-Free Graph Languages Generated by Edge Replacement, Lect. Not. Comp. Sci. 153, 143\u2013158 (1983)","journal-title":"Lect. Not. Comp. Sci."},{"key":"2_CR10","unstructured":"\u2014: Characteristics of Graph Languages Generated by Edge Replacement, University of Bremen, Comp. Sci. Report No. 3\/85 (1985), also in Theor. Comp. Sci. 51, 81\u2013115 (1987)"},{"key":"2_CR11","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BFb0039608","volume":"247","author":"A. Habel","year":"1987","unstructured":"\u2014 Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement, Lect. Not. Comp. Sci. 247, 207\u2013219 (1987)","journal-title":"Lect. Not. Comp. Sci."},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0020-0255(80)90038-9","volume":"20","author":"D. Janssens","year":"1980","unstructured":"D. Janssens, G. Rozenberg: On the Structure of Node-Label-Controlled Graph Grammars, Information Science 20, 191\u2013216 (1980)","journal-title":"Information Science"},{"key":"2_CR13","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/0022-0000(81)90025-8","volume":"20","author":"D. Janssens","year":"1981","unstructured":"\u2014 Decision Problems for NLC Grammars, Journal of Comp. and System Sciences 20 (1981), 144\u2013177","journal-title":"Journal of Comp. and System Sciences"},{"key":"2_CR14","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/BFb0000108","volume":"153","author":"M. Kaul","year":"1983","unstructured":"M. Kaul: Parsing of Graphs in Linear Time, Lect. Not. Comp. Sci. 153, 206\u2013218 (1983)","journal-title":"Lect. Not. Comp. Sci."},{"key":"2_CR15","unstructured":"H.-J. Kreowski: Manipulationen von Graphmanipulationen, Ph. D. Thesis, Techn. Univ. Berlin, Comp. Sci. Dept., 1977"},{"key":"2_CR16","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/BFb0025726","volume":"73","author":"H.-J. Kreowski","year":"1979","unstructured":"\u2014: A Pumping Lemma for Context-Free Graph Languages, Lect. Not. Comp. Sci. 73, 270\u2013283 (1979)","journal-title":"Lect. Not. Comp. Sci."},{"key":"2_CR17","first-page":"217","volume-title":"The Book of L","author":"K. H.-J","year":"1986","unstructured":"\u2014 Rule Trees Represent Derivations in Edge Replacement Systems, in G. Rozenberg, A. Salomaa (eds.): The Book of L, Springer Verlag, Berlin-Heidelberg 1986, 217\u2013232"},{"key":"2_CR18","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0020-0190(84)90069-3","volume":"18","author":"H.-J. Kreowski","year":"1984","unstructured":"H.-J. Kreowski, G. Rozenberg: Note on Node-Rewriting Graph Grammars, Information Processing Letters 18, 21\u201324 (1984)","journal-title":"Information Processing Letters"},{"key":"2_CR19","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1007\/3-540-15198-2_18","volume":"185","author":"U. Lichtblau","year":"1985","unstructured":"U. Lichtblau: Decompilation of Control Structures by Means of Graph Transformations, Lect. Not. Comp. Sci. 185, 284\u2013297 (1985)","journal-title":"Lect. Not. Comp. Sci."},{"issue":"1","key":"2_CR20","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321679.321682","volume":"19","author":"T. Pavlidis","year":"1972","unstructured":"T. Pavlidis: Linear and Context-Free Graph Grammars, Journ. ACM 19, 1, 11\u201323 (1972)","journal-title":"Journ. ACM"},{"key":"2_CR21","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1016\/S0022-0000(71)80016-8","volume":"5","author":"T.W. Pratt","year":"1971","unstructured":"T.W. Pratt: Pair Grammars, Graph Languages and String-to-Graph Translations, Journ. Comp. Syst. Sci. 5 (1971), 560\u2013595","journal-title":"Journ. Comp. Syst. Sci."},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/S0019-9958(86)80045-6","volume":"69","author":"G. Rozenberg","year":"1986","unstructured":"G. Rozenberg, E. Welzl: Boundary NLC Graph Grammars-Basic Definitions, Normal Forms and Complexity, Information and Control 69, 136\u2013167 (1986)","journal-title":"Information and Control"},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF00289115","volume":"23","author":"G. Rozenberg","year":"1986","unstructured":"\u2014 Graph Theoretic Closure Properties of the Family of Boundary NLC Graph Languages, Acta Informatica 23, 289\u2013309 (1986)","journal-title":"Acta Informatica"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"I. Suzuki, T. Murata: Stepwise Refinements of Transitions and Places, Informatik-Fachberichte 52, Springer, 136\u2013141 (1980)","DOI":"10.1007\/978-3-642-68353-4_23"},{"key":"2_CR25","first-page":"271","volume":"6","author":"G. Tur\u00e1n","year":"1983","unstructured":"G. Tur\u00e1n: On the Complexity of Graph Grammars, Acta Cybern, 6, 271\u2013281 (1983)","journal-title":"Acta Cybern"},{"key":"2_CR26","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0022-0000(79)90050-3","volume":"18","author":"R. Valette","year":"1979","unstructured":"R. Valette: Analysis of Petri Nets by Stepwise Refinements, Journ. Comp. Syst. Sci. 18, 35\u201346 (1979)","journal-title":"Journ. Comp. Syst. Sci."},{"key":"2_CR27","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0019-9958(71)90419-0","volume":"18","author":"M.K. Yntema","year":"1971","unstructured":"M.K. Yntema: 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":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18771-5_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:15:29Z","timestamp":1605626129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18771-5_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540187714","9783540481782"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-18771-5_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}