{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:16:10Z","timestamp":1725455770993},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540552840"},{"type":"electronic","value":"9783540470120"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/bfb0023815","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T01:17:40Z","timestamp":1132363060000},"page":"32-45","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A decidability result about convex polyominoes"],"prefix":"10.1007","author":[{"given":"Dani\u00e8le","family":"Beauquier","sequence":"first","affiliation":[]},{"given":"Michel","family":"Latteux","sequence":"additional","affiliation":[]},{"given":"Karine","family":"Slowinski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0020-0190(91)90217-6","volume":"37","author":"D. Beauquier","year":"1991","unstructured":"D. Beauquier, A Undecidable Problem about Rational Sets and Contour Words of Polyominoes, Information Processing Letters\n37 (1991), 257\u2013263.","journal-title":"Information Processing Letters"},{"key":"4_CR2","first-page":"72","volume":"66","author":"R. Berger","year":"1966","unstructured":"R. Berger, The undecidability of the domino problem, Memoirs Amer. Math. Soc.\n66 (1966), 72.","journal-title":"Memoirs Amer. Math. Soc."},{"key":"4_CR3","volume-title":"Technical Report I.T. 214","author":"D. Beauquier","year":"1991","unstructured":"D. Beauquier, M. Latteux, K. Slowinski, A decidability result about convex polyominoes, Technical Report I.T. 214 (1991), University of Lille, France."},{"key":"4_CR4","unstructured":"D. Beauquier, M. Nivat, On translating one polyomino to tile the plane, Discrete and Computational Geometry, to appear."},{"key":"4_CR5","first-page":"53","volume":"34","author":"J. Dassow","year":"1988","unstructured":"J. Dassow, Convexity and Simplicity of Chain Code Picture Languages, Rostock. Math. Kolloq.\n34 (1988), 53\u201360.","journal-title":"Rostock. Math. Kolloq."},{"key":"4_CR6","first-page":"423","volume":"EIK25","author":"J. Dassow","year":"1989","unstructured":"J. Dassow, Graph-theoretical Properties and Chain Code Picture Languages, J. Inf. Process. Cybern.\nEIK25 (1989), 423\u2013433.","journal-title":"J. Inf. Process. Cybern."},{"key":"4_CR7","unstructured":"J. Dassow, F. Hinz, Decision Problems and Regular Chain Code Picture Languages, to appear in Discrete Applied Mathematics."},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(84)90116-6","volume":"34","author":"M.P. Delest","year":"1984","unstructured":"M.P. Delest and G. Viennot, Algebraic Languages and Polyominoes enumeration, Theoretical Computer Science\n34 (1984), 169\u2013206.","journal-title":"Theoretical Computer Science"},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"130","DOI":"10.2307\/3615527","volume":"66","author":"D. Ellard","year":"1982","unstructured":"D. Ellard, Poyominoes and Enumeration, Math. Gazette\n66 (1982), 130\u2013314.","journal-title":"Math. Gazette"},{"key":"4_CR10","volume-title":"Polyominoes","author":"S.W. Golomb","year":"1966","unstructured":"S.W. Golomb, Polyominoes, Georges Allen and Unwin Ltd (London, 1966)."},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/S0021-9800(70)80055-2","volume":"9","author":"S.W. Golomb","year":"1970","unstructured":"S.W. Golomb, Tiling with sets of Polyominoes, S. Combinatorial Theory\n9 (1970), 60\u201371.","journal-title":"S. Combinatorial Theory"},{"key":"4_CR12","volume-title":"Tilings and Patterns","author":"B. Gr\u00fcnbaum","year":"1986","unstructured":"B. Gr\u00fcnbaum, G.C. Shephard, Tilings and Patterns, Freeman & Company (New York, 1986)."},{"key":"4_CR13","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley (Reading MA, 1979)."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"M. Jantzen, Confluent string rewriting, EATCS Monog. on T.C.S. 14 (Springer-Verlag, 1988).","DOI":"10.1007\/978-3-642-61549-8"},{"key":"4_CR15","unstructured":"J.E. Pin, Vari\u00e9t\u00e9s de langages formels, Masson (1984)."},{"key":"4_CR16","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01418780","volume":"12","author":"R.M. Robinson","year":"1971","unstructured":"R.M. Robinson, Undecidability and non Periodicity of Tilings of the Plane, Inventione Math.\n12 (1971), 177\u2013209.","journal-title":"Inventione Math."},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"H.D. Shapiro, Theorical limitations on the efficient user of parallel memories, I.E.E. Trans. Computing (1978).","DOI":"10.1109\/TC.1978.1675122"},{"key":"4_CR18","volume-title":"Ph. D. Thesis","author":"K. Slowinski","year":"1992","unstructured":"K. Slowinski, Syst\u00e8mes de r\u00e9\u00e9criture et langages de mots de figure, Ph. D. Thesis (1992), University of Lille, France."},{"key":"4_CR19","doi-asserted-by":"crossref","first-page":"295","DOI":"10.4064\/fm-82-4-295-305","volume":"82","author":"H. Wang","year":"1975","unstructured":"H. Wang, Notes on a class of tiling problems, Fundam. Mathematics\n82 (1975), 295\u2013305.","journal-title":"Fundam. Mathematics"},{"key":"4_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(84)80007-8","volume":"62","author":"H.A.G. Wiljshoff","year":"1984","unstructured":"H.A.G. Wiljshoff, J. Van Leeuwen, Periodic versus arbitrary tessellations of the plane using polyominoes of a single type, Inf. Control\n62 (1984), 1\u201325.","journal-title":"Inf. Control"}],"container-title":["Lecture Notes in Computer Science","LATIN '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023815","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:01:45Z","timestamp":1558256505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023815"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540552840","9783540470120"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0023815","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"9 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}