{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T02:02:18Z","timestamp":1782439338264,"version":"3.54.5"},"publisher-location":"Berlin\/Heidelberg","reference-count":24,"publisher":"Springer-Verlag","isbn-type":[{"value":"354017219X","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0039608","type":"book-chapter","created":{"date-parts":[[2006,1,31]],"date-time":"2006-01-31T11:55:52Z","timestamp":1138708552000},"page":"207-219","source":"Crossref","is-referenced-by-count":51,"title":["Some structural aspects of hypergraph languages generated by hyperedge replacement"],"prefix":"10.1007","author":[{"given":"Annegret","family":"Habel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hans-J\u00f6rg","family":"Kreowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"M. Bauderon, B. Courcelle: Graph Expressions and Graph Rewriting, Comp. Sci. Research Report no. 8525, University of Bordeaux (1985)"},{"key":"18_CR2","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/3-540-10291-4_13","volume":"100","author":"C. Batini","year":"1981","unstructured":"C. Batini, A. D'Atri: Schema Hypergraphs: A Formalism to Investigate Logical Data Base Design, Lect. Not. Comp. Sci. 100, 177\u2013194 (1981)","journal-title":"Lect. Not. Comp. Sci."},{"key":"18_CR3","unstructured":"C. Berge: Graphs and Hypergraphs, North-Holland (1973)"},{"key":"18_CR4","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/BFb0000097","volume":"153","author":"I. Castellani","year":"1983","unstructured":"I. Castellani, U. Montanari: Graph Grammars for Distributed Systems, Lect. Not. Comp. Sci. 153 (1983), 20\u201338","journal-title":"Lect. Not. Comp. Sci."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"V. Claus, H. Ehrig, G. Rozenberg (eds.): Graph-Grammars and Their Application to Computer Science and Biology, Lect. Not. Comp. Sci. 73 (1979)","DOI":"10.1007\/BFb0025713"},{"key":"18_CR6","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\u201319 (1979)","journal-title":"Lect. Not. Comp. Sci."},{"key":"18_CR7","doi-asserted-by":"crossref","first-page":"13","DOI":"10.3233\/FI-1986-9103","volume":"IX","author":"H. Ehrig","year":"1986","unstructured":"H. Ehrig, A. Habel, B.K. Rosen: Rosen: Concurrent Transformations of Relational Structures, Fundamenta Informaticae IX 13\u201350 (1986)","journal-title":"Fundamenta Informaticae"},{"key":"18_CR8","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF01752403","volume":"14","author":"H. Ehrig","year":"1981","unstructured":"H. Ehrig, H.-J. Kreowski, A. Maggiolo-Schettini, B.K. Rosen, and J. Winkowski: Transformations of Structures: An Algebraic Approach, Math. Syst. Theory 14, 305\u2013334 (1981)","journal-title":"Math. Syst. Theory"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"H. Ehrig, M. Nagl, G. Rozenberg (eds.): Graph-Grammars and Their Application to Computer Science, 2nd Int. Workshop on Graph Grammars and Their Application to Computer Science, Lect. Not. Comp. Sci. 153 (1983)","DOI":"10.1007\/BFb0000094"},{"key":"18_CR10","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":"18_CR11","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":"18_CR12","first-page":"143","volume":"153","author":"A. Habel","year":"1983","unstructured":"A. Habel, H.-J. Kreowski: On Context-Free Graph Languages Generated by Edge Replacement, LNCS 153, 143\u2013158 (1983)","journal-title":"LNCS"},{"key":"18_CR13","unstructured":"\u2014: Characteristics of Graph Languages Generated by Edge Replacement, University of Bremen, Comp. Sci. Report No. 3\/85 (1985), to appear in Theor. Comp. Sci."},{"key":"18_CR14","unstructured":"J.E. Hopcroft, J.D. Ullman: Formal Languages and Their Relation to Automata, Addison-Wesley 1969"},{"key":"18_CR15","doi-asserted-by":"crossref","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":"18_CR16","unstructured":"H.-J. Kreowski: Manipulationen von Graphmanipulationen, Ph. D. Thesis, Techn. Univ. Berlin, Comp. Sci. Dept., 1977"},{"key":"18_CR17","first-page":"270","volume":"73","author":"K. H.-J","year":"1979","unstructured":"\u2014: A Pumping Lemma for Context-Free Graph Languages, LNCS 73, 270\u2013283 (1979)","journal-title":"LNCS"},{"key":"18_CR18","first-page":"284","volume":"185","author":"U. Lichtblau","year":"1985","unstructured":"U. Lichtblau: Decompilation of Control Structures by Means of Graph Transformations, LNCS 185, 284\u2013297 (1985)","journal-title":"LNCS"},{"key":"18_CR19","first-page":"70","volume":"73","author":"M. Nagl","year":"1979","unstructured":"M. Nagl: A Tutorial and Bibliographical Survey on Graph Grammars, LNCS 73, 70\u2013126 (1979)","journal-title":"LNCS"},{"issue":"1","key":"18_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":"18_CR21","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S0022-0000(75)80067-5","volume":"11","author":"V. Rajlich","year":"1975","unstructured":"V. Rajlich: Dynamics of Discrete Systems and Pattern Reproduction, Journ. Comp. Syst. Sci. 11, 186\u2013202 (1975)","journal-title":"Journ. Comp. Syst. Sci."},{"key":"18_CR22","first-page":"319","volume":"83","author":"H. Schmeck","year":"1983","unstructured":"H. Schmeck: Flow Graph Grammars and Flow Graph Languages, in M. Nagl, J. Perl (eds.): Graphtheoretic Concepts in Computer Science, Proc. of the WG' 83, 319\u2013329 (1983)","journal-title":"Proc. of the WG'"},{"key":"18_CR23","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/978-3-642-68353-4_23","volume":"52","author":"I. Suzuki","year":"1980","unstructured":"I. Suzuki, T. Murata: Stepwise Refinements of Transitions and Places, Informatik-Fachberichte 52, Springer, 136\u2013141 (1980)","journal-title":"Informatik-Fachberichte"},{"key":"18_CR24","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."}],"container-title":["Lecture Notes in Computer Science","STACS 87"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0039608.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T06:41:35Z","timestamp":1627022495000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0039608"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354017219X"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/bfb0039608","relation":{},"subject":[]}}