{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:10:51Z","timestamp":1726409451512},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319049205"},{"type":"electronic","value":"9783319049212"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-04921-2_7","type":"book-chapter","created":{"date-parts":[[2014,2,5]],"date-time":"2014-02-05T13:52:25Z","timestamp":1391608345000},"page":"88-100","source":"Crossref","is-referenced-by-count":0,"title":["Picture Codes with Finite Deciphering Delay"],"prefix":"10.1007","author":[{"given":"Marcella","family":"Anselmo","sequence":"first","affiliation":[]},{"given":"Dora","family":"Giammarresi","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Madonia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0304-3975(94)00201-S","volume":"147","author":"P. Aigrain","year":"1995","unstructured":"Aigrain, P., Beauquier, D.: Polyomino tilings, cellular automata and codicity. Theoretical Computer Science\u00a0147, 165\u2013180 (1995)","journal-title":"Theoretical Computer Science"},{"issue":"2-3","key":"7_CR2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.3233\/FI-2010-221","volume":"98","author":"M. Anselmo","year":"2010","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: Deterministic and unambiguous families within recognizable two-dimensional languages. Fund. Inform\u00a098(2-3), 143\u2013166 (2010)","journal-title":"Fund. Inform"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-642-40663-8_6","volume-title":"Algebraic Informatics","author":"M. Anselmo","year":"2013","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: Strong prefix codes of pictures. In: Muntean, T., Poulakis, D., Rolland, R. (eds.) CAI 2013. LNCS, vol.\u00a08080, pp. 47\u201359. Springer, Heidelberg (2013)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-642-38771-5_6","volume-title":"Developments in Language Theory","author":"M. Anselmo","year":"2013","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: Two-dimensional codes of pictures. In: B\u00e9al, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol.\u00a07907, pp. 46\u201357. Springer, Heidelberg (2013)"},{"issue":"2","key":"7_CR5","first-page":"227","volume":"40","author":"M. Anselmo","year":"2006","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M., Restivo, A.: Unambiguous recognizable two-dimensional languages. RAIRO: Theoretical Informatics and Applications\u00a040(2), 227\u2013294 (2006)","journal-title":"RAIRO: Theoretical Informatics and Applications"},{"issue":"16","key":"7_CR6","doi-asserted-by":"publisher","first-page":"1477","DOI":"10.1016\/j.tcs.2008.12.009","volume":"410","author":"M. Anselmo","year":"2009","unstructured":"Anselmo, M., Madonia, M.: Deterministic and unambiguous two-dimensional languages over one-letter alphabet. Theoretical Computer Science\u00a0410(16), 1477\u20131485 (2009)","journal-title":"Theoretical Computer Science"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/S0304-3975(03)00029-X","volume":"303","author":"D. Beauquier","year":"2003","unstructured":"Beauquier, D., Nivat, M.: A codicity undecidable problem in the plane. Theoret. Comp. Sci.\u00a0303, 417\u2013430 (2003)","journal-title":"Theoret. Comp. Sci."},{"doi-asserted-by":"crossref","unstructured":"Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press (2009)","key":"7_CR8","DOI":"10.1017\/CBO9781139195768"},{"issue":"4","key":"7_CR9","first-page":"537","volume":"40","author":"S. Bozapalidis","year":"2006","unstructured":"Bozapalidis, S., Grammatikopoulou, A.: Picture codes. ITA\u00a040(4), 537\u2013550 (2006)","journal-title":"ITA"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/S0195-6698(13)80036-4","volume":"11","author":"V. Bruy\u00e8re","year":"1990","unstructured":"Bruy\u00e8re, V., Wang, L., Zhang, L.: On completion of codes with finite deciphering delay. Europ. J. Combinatorics\u00a011, 513\u2013521 (1990)","journal-title":"Europ. J. Combinatorics"},{"issue":"2-3","key":"7_CR11","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1142\/S021800149200014X","volume":"6","author":"D. Giammarresi","year":"1992","unstructured":"Giammarresi, D., Restivo, A.: Recognizable picture languages. Int. Journal Pattern Recognition and Artificial Intelligence\u00a06(2-3), 241\u2013256 (1992)","journal-title":"Int. Journal Pattern Recognition and Artificial Intelligence"},{"doi-asserted-by":"crossref","unstructured":"Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G. (ed.) Handbook of Formal Languages, vol.\u00a0III, pp. 215\u2013268. Springer (1997)","key":"7_CR12","DOI":"10.1007\/978-3-642-59126-6_4"},{"unstructured":"Grammatikopoulou, A.: Prefix picture sets and picture codes. In: Procs. CAI 2005, pp. 255\u2013268. Aristotle University of Thessaloniki (2005)","key":"7_CR13"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-35926-2_25","volume-title":"Combinatorial Algorithms","author":"M. Kolarz","year":"2012","unstructured":"Kolarz, M., Moczurad, W.: Multiset, Set and Numerically Decipherable Codes over Directed Figures. In: Smyth, B. (ed.) IWOCA 2012. LNCS, vol.\u00a07643, pp. 224\u2013235. Springer, Heidelberg (2012)"},{"issue":"5-6","key":"7_CR15","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1023\/A:1023027932419","volume":"91","author":"K. Lindgren","year":"1998","unstructured":"Lindgren, K., Moore, C., Nordahl, M.: Complexity of two-dimensional patterns. Journal of Statistical Physics\u00a091(5-6), 909\u2013951 (1998)","journal-title":"Journal of Statistical Physics"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-27798-9_10","volume-title":"Computing and Combinatorics","author":"M. Moczurad","year":"2004","unstructured":"Moczurad, M., Moczurad, W.: Some open problems in decidability of brick (Labelled polyomino) codes. In: Chwa, K.-Y., Munro, J.I. (eds.) COCOON 2004. LNCS, vol.\u00a03106, pp. 72\u201381. Springer, Heidelberg (2004)"},{"issue":"2","key":"7_CR17","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0304-3975(98)00328-4","volume":"218","author":"D. Simplot","year":"1991","unstructured":"Simplot, D.: A characterization of recognizable picture languages by tilings by finite sets. Theoretical Computer Science\u00a0218(2), 297\u2013323 (1991)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-04921-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,15]],"date-time":"2020-08-15T02:45:47Z","timestamp":1597459547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-04921-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319049205","9783319049212"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04921-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}