{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T08:21:51Z","timestamp":1777105311363,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540612285","type":"print"},{"value":"9783540683889","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61228-9_102","type":"book-chapter","created":{"date-parts":[[2006,7,17]],"date-time":"2006-07-17T14:17:05Z","timestamp":1153145825000},"page":"412-427","source":"Crossref","is-referenced-by-count":7,"title":["Chain-code pictures and collages generated by hyperedge replacement"],"prefix":"10.1007","author":[{"given":"J\u00fcrgen","family":"Dassow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Annegret","family":"Habel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Taubenberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,9,7]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0020-0190(91)90217-6","volume":"37","author":"D. Beauquier","year":"1991","unstructured":"Dani\u00e9le Beauquier. An undecidability problem about rational sets and contour words of polyominoes. Information Processing Letters 37, 257\u2013263, 1991.","journal-title":"Information Processing Letters"},{"key":"28_CR2","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"Claude Berge. Graphs and Hypergraphs. North Holland, Amsterdam, 1973."},{"key":"28_CR3","volume-title":"Introduction to Geometry","author":"H.S.M. Coxeter","year":"1989","unstructured":"H.S.M. Coxeter. Introduction to Geometry. Wiley Classics Library Edition, John Wiley & Sons, Inc., New York, second edition edition, 1989.","edition":"second edition"},{"key":"28_CR4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0166-218X(93)90138-E","volume":"45","author":"J. Dassow","year":"1993","unstructured":"J\u00fcrgen Dassow, Friedhelm Hinz. Decision problems and regular chain code picture languages. Discrete Applied Mathematics 45, 29\u201349, 1993.","journal-title":"Discrete Applied Mathematics"},{"key":"28_CR5","unstructured":"Frank Drewes. Language theoretic and algorithmic properties of collages and pattern living in a grid. Journal of Computer and System Sciences, 1995. To appear."},{"key":"28_CR6","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0304-3975(94)00118-3","volume":"145","author":"F. Drewes","year":"1995","unstructured":"Frank Drewes, Annegret Habel, Hans-J\u00f6rg Kreowski, Stefan Taubenberger. Generating self-affine fractals by collage grammars. Theoretical Computer Science 145, 159\u2013187, 1995.","journal-title":"Theoretical Computer Science"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Frank Drewes, Hans-J\u00f6rg Kreowski. (Un-)decidability of geometric properties of pictures generated by collage grammars. Fundamenta Informaticae, 1995. To appeal.","DOI":"10.3233\/FI-1996-253407"},{"key":"28_CR8","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1051\/ita\/1994283-404051","volume":"28","author":"S. Dube","year":"1994","unstructured":"Simant Dube. Fractal geometry, turing machines and divide-and-conquer recurrences. RAIRO Theoretical Informatics and Applications 28, 405\u2013423, 1994.","journal-title":"RAIRO Theoretical Informatics and Applications"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Annegret Habel, Hans-J\u00f6rg Kreowski. Pretty patterns produced by hyperedge replacement. In H. G\u00f6ttler, H.J. Schneider, eds., Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 314, 32\u20135, 1988.","DOI":"10.1007\/3-540-19422-3_3"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Annegret Habel, Hans-J\u00f6rg Kreowski. Collage grammars. In H. Ehrig, H.-J. Kreowski, G. Rozenberg, eds., Graph Grammars and Their Application to Computer Science, Lecture Notes in Computer Science 532, 411\u2013429, 1991.","DOI":"10.1007\/BFb0017403"},{"key":"28_CR11","first-page":"125","volume":"1","author":"A. Habel","year":"1993","unstructured":"Annegret Habel, Hans-J\u00f6rg Kreowski, Stefan Taubenberger. Collages and patterns generated by hyperedge replacement. Languages of Design 1, 125\u2013145, 1993.","journal-title":"Languages of Design"},{"key":"28_CR12","volume-title":"Introduction to Automata Theory, Languages and Compuation","author":"J. E. Hopcroft","year":"1979","unstructured":"John E. Hopcroft, Jeffrey D. Ullman. Introduction to Automata Theory, Languages and Compuation. Addison-Wesley, Reading, Mass., 1979."},{"key":"28_CR13","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0304-3975(90)90180-P","volume":"73","author":"C. Kim","year":"1990","unstructured":"Changwook Kim. Complexity and decidability for restricted classes of picture languages. Theoretical Computer Science 73, 295\u2013311, 1990.","journal-title":"Theoretical Computer Science"},{"key":"28_CR14","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0019-9958(82)80020-X","volume":"54","author":"H. A. Maurer","year":"1982","unstructured":"Hermann A. Maurer, Grzegorz Rozenberg, Emo Welzl. Using string languages to describe picture languages. Information and Control 54, 155\u2013185, 1982.","journal-title":"Information and Control"},{"key":"28_CR15","unstructured":"Denis Robilliard. Undecidable questions in picture languages. Technical Report IT 262, Universit\u00e9 de Lille, 1994."},{"key":"28_CR16","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0304-3975(85)90041-6","volume":"36","author":"I. H. Sudborough","year":"1985","unstructured":"Ivan Hal Sudborough, Emo Welzl. Complexity and decidability for chain code picture languages. Theoretical Computer Science 36, 173\u2013202, 1985.","journal-title":"Theoretical Computer Science"},{"key":"28_CR17","unstructured":"Stefan Taubenberger. Correct translations of generalized iterated function systems to collage grammars. Technical Report 7\/94, Bremen, 1994."}],"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-61228-9_102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,16]],"date-time":"2020-04-16T21:56:53Z","timestamp":1587074213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61228-9_102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540612285","9783540683889"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-61228-9_102","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}