{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:25Z","timestamp":1725456025984},"publisher-location":"Berlin\/Heidelberg","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354057879X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017491","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:47:11Z","timestamp":1132645631000},"page":"322-334","source":"Crossref","is-referenced-by-count":0,"title":["Superposition in picture languages"],"prefix":"10.1007","author":[{"given":"Bodonirina","family":"Ratoandromanana","sequence":"first","affiliation":[]},{"given":"Denis","family":"Robilliard","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0020-0190(91)90217-6","volume":"37","author":"D. Beauquier","year":"1991","unstructured":"Dani\u00e8le Beauquier. An undecidable problem about rationnal sets and contour words of polyominoes. Information Processing Letters, 37:257\u2013263, 1991.","journal-title":"Information Processing Letters"},{"key":"22_CR2","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BFb0023815","volume":"583","author":"D. Beauquier","year":"1992","unstructured":"Dani\u00e8le Beauquier, Michel Latteux, and Karine Slowinski. A decidability result about convex polyominoes. In Lecture Notes in Computer Science, volume 583, pages 32\u201345, 1992.","journal-title":"Lecture Notes in Computer Science"},{"key":"22_CR3","unstructured":"Dani\u00e8le Beauquier and Maurice Nivat. Tiling pictures of the plane with two bars, a horizontal and a vertical one. Technical Report LITP 91.67, LITP, November 1991."},{"issue":"4","key":"22_CR4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1051\/ita\/1993270100491","volume":"27","author":"F. J. Brandenburg","year":"1993","unstructured":"Franz J. Brandenburg and J\u00fcrgen Dassow. Efficient reductions of picture words. Theoretical Informatics and Applications, 27(4):49\u201356, 1993.","journal-title":"Theoretical Informatics and Applications"},{"key":"22_CR5","first-page":"423","volume":"EIK 25","author":"J. Dassow","year":"1989","unstructured":"J\u00fcrgen Dassow. Graph-theoretical properties and chain code picture languages. J. Inf. Process. Cybern., EIK 25:423\u2013433, 1989.","journal-title":"J. Inf. Process. Cybern."},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0304-3975(91)90196-9","volume":"81","author":"J. Dassow","year":"1991","unstructured":"J\u00fcrgen Dassow. On the connectedness of pictures in chain code picture languages. Theoretical Computer Science, 81:289\u2013294, 1991.","journal-title":"Theoretical Computer Science"},{"key":"22_CR7","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TEC.1961.5219197","volume":"10","author":"H. Freeman","year":"1961","unstructured":"H. Freeman. On the encoding of arbitrary geometric configuration. Ire Transactions on Electronic Computers, 10:260\u2013268, 1961.","journal-title":"Ire Transactions on Electronic Computers"},{"key":"22_CR8","unstructured":"Roger Gutbrod. Branch picture languages. Technical report, Aachen University, 1991."},{"key":"22_CR9","unstructured":"Friedhelm Hinz and Emo Welzl. Regular chain code picture languages with invisible lines. Technical Report 252, Graz University of Technology, 1988."},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Changwook Kim. Complexity and decidability for restricted classes of picture languages. Theoretical Computer Science, 73, 1990.","DOI":"10.1016\/0304-3975(90)90180-P"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0304-3975(92)90122-V","volume":"104","author":"C. Kim","year":"1992","unstructured":"Changwook Kim and Ivan Hal Sudborough. On reversal-bounded picture languages. Theoretical Computer Science, 104:185\u2013206, 1992.","journal-title":"Theoretical Computer Science"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0019-9958(82)80020-X","volume":"54","author":"H. A. Maurer","year":"1982","unstructured":"H. A. Maurer, G. Rozenberg, and E. Welzl. Using string languages to describe picture languages. Information and Control, 54:155\u2013185, 1982.","journal-title":"Information and Control"},{"key":"22_CR13","volume-title":"Technical Report IT-92-239","author":"G. P\u0103un","year":"1992","unstructured":"Gheorge P\u0103un, Denis Robilliard, and Karine Slowinski. Connected pictures and minimal words with blank moves. Technical Report IT-92-239, LIFL, Universit\u00e9 des Sciences et Technologies de Lille, France, November 1992."},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1111\/1467-8659.1040319","volume":"10","author":"P. S\u00e9\u00e9bold","year":"1991","unstructured":"Patrice S\u00e9\u00e9bold and Karine Slowinski. The shortest way to draw a connected picture. Computer Graphics Forum, 10:319\u2013327, 1991.","journal-title":"Computer Graphics Forum"},{"key":"22_CR15","unstructured":"Jihad Tatari and Eric Tosan. Repr\u00e9sentation des polyominos. In Actes de GROPLAN'92, 1992."}],"container-title":["Lecture Notes in Computer Science","Trees in Algebra and Programming \u2014 CAAP'94"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017491.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:38:41Z","timestamp":1607549921000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017491"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354057879X"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0017491","relation":{},"subject":[]}}