{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:13:04Z","timestamp":1762297984683},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387708"},{"type":"electronic","value":"9783642387715"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38771-5_6","type":"book-chapter","created":{"date-parts":[[2013,6,10]],"date-time":"2013-06-10T02:16:25Z","timestamp":1370830585000},"page":"46-57","source":"Crossref","is-referenced-by-count":11,"title":["Two Dimensional Prefix Codes of Pictures"],"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":"6_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":"6_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."},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1051\/ita:2006008","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"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-95891-8_11","volume-title":"SOFSEM 2009: Theory and Practice of Computer Science","author":"M. Anselmo","year":"2009","unstructured":"Anselmo, M., Jonoska, N., Madonia, M.: Framed Versus Unframed Two-dimensional Languages. In: Nielsen, M., Ku\u010dera, A., Miltersen, P.B., Palamidessi, C., T\u016fma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol.\u00a05404, pp. 79\u201392. Springer, Heidelberg (2009)"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"1477","DOI":"10.1016\/j.tcs.2008.12.009","volume":"410-16","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":"6_CR6","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."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195768"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Blum, M., Hewitt, C.: Automata on a two-dimensional tape. In: IEEE Symposium on Switching and Automata Theory, pp. 155\u2013160 (1967)","DOI":"10.1109\/FOCS.1967.6"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Book, R.V., Otto, F.: String-rewriting Systems. Springer (1993)","DOI":"10.1007\/978-1-4613-9771-7"},{"issue":"4","key":"6_CR10","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"},{"issue":"2 & 3","key":"6_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"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G., et al. (eds.) Handbook of Formal Languages, vol. III, pp. 215\u2013268. Springer (1997)","DOI":"10.1007\/978-3-642-59126-6_4"},{"key":"6_CR13","unstructured":"Grammatikopoulou, A.: Prefix Picture Sets and Picture Codes. In: Procs. CAI 2005, pp. 255\u2013268 (2005)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/978-3-642-35926-2_25","volume-title":"IWOCA 2012","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)"},{"key":"6_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626302","volume-title":"An Introduction to Symbolic Dynamics and Coding","author":"D. Lind","year":"1995","unstructured":"Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge (1995)"},{"issue":"5-6","key":"6_CR16","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":"6_CR17","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)"},{"key":"6_CR18","first-page":"297","volume":"218-2","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","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38771-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,28]],"date-time":"2020-07-28T02:16:33Z","timestamp":1595902593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38771-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387708","9783642387715"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38771-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}