{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:32Z","timestamp":1760202692337,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319155784"},{"type":"electronic","value":"9783319155791"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15579-1_24","type":"book-chapter","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T08:36:13Z","timestamp":1424680573000},"page":"315-327","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Structure and Measure of a Decidable Class of Two-dimensional Codes"],"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","published-online":{"date-parts":[[2015,2,24]]},"reference":[{"key":"24_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 147, 165\u2013180 (1995)","journal-title":"Theoretical Computer Science"},{"issue":"2\u20133","key":"24_CR2","first-page":"143","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 98(2\u20133), 143\u2013166 (2010)","journal-title":"Fund. Inform"},{"key":"24_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. 8080, pp. 47\u201359. Springer, Heidelberg (2013)"},{"key":"24_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 Prefix Codes of Pictures. In: B\u00e9al, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 46\u201357. Springer, Heidelberg (2013)"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: Prefix picture codes: a decidable class of two-dimensional codes. Int. Jou. of Foundations of Computer Science (to appear, 2015)","DOI":"10.1007\/978-3-319-15579-1_24"},{"issue":"2","key":"24_CR6","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 -ITA 40(2), 227\u2013294 (2006)","journal-title":"RAIRO -ITA"},{"issue":"16","key":"24_CR7","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 410(16), 1477\u20131485 (2009)","journal-title":"Theoretical Computer Science"},{"key":"24_CR8","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\\r{u}ma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol. 5404, pp. 79\u201392. Springer, Heidelberg (2009)"},{"key":"24_CR9","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. 303, 417\u2013430 (2003)","journal-title":"Theoret. Comp. Sci."},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195768"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: SWAT (FOCS). pp. 155\u2013160 (1967)","DOI":"10.1109\/FOCS.1967.6"},{"issue":"4","key":"24_CR12","first-page":"537","volume":"40","author":"S Bozapalidis","year":"2006","unstructured":"Bozapalidis, S., Grammatikopoulou, A.: Picture codes. RAIRO - ITA 40(4), 537\u2013550 (2006)","journal-title":"RAIRO - ITA"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G., (ed.) Handbook of Formal Languages, Vol. III, pp. 215\u2013268. Springer (1997)","DOI":"10.1007\/978-3-642-59126-6_4"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-24897-9_9","volume-title":"Algebraic Foundations in Computer Science","author":"J Kari","year":"2011","unstructured":"Kari, J., Salo, V.: A Survey on Picture-Walking Automata. In: Kuich, W., Rahonis, G. (eds.) Algebraic Foundations in Computer Science. LNCS, vol. 7020, pp. 183\u2013213. Springer, Heidelberg (2011)"},{"key":"24_CR15","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":"Language and Automata Theory and Applications","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. 7643, pp. 224\u2013235. Springer, Heidelberg (2012)"},{"issue":"1","key":"24_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(81)90064-8","volume":"12","author":"S Mauceri","year":"1981","unstructured":"Mauceri, S., Restivo, A.: A family of codes commutatively equivalent to prefix codes. Inf. Process. Lett. 12(1), 1\u20134 (1981)","journal-title":"Inf. Process. Lett."},{"key":"24_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-319-04921-2_44","volume-title":"Language and Automata Theory and Applications","author":"F Otto","year":"2014","unstructured":"Otto, F., Mr\u00e1z, F.: Extended Two-Way Ordered Restarting Automata for Picture Languages. In: Dediu, A.-H., Mart\\\u2019\u0131n-Vide, C., Sierra-Rodr\\\u2019\u0131guez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol. 8370, pp. 541\u2013552. Springer, Heidelberg (2014)"},{"issue":"9","key":"24_CR18","doi-asserted-by":"publisher","first-page":"1246","DOI":"10.1016\/j.ic.2011.07.001","volume":"209","author":"M Pradella","year":"2011","unstructured":"Pradella, M., Cherubini, A., Crespi-Reghizzi, S.: A unifying approach to picture grammars. Inf. Comput. 209(9), 1246\u20131267 (2011)","journal-title":"Inf. Comput."},{"key":"24_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-642-38771-5_36","volume-title":"Developments in Language Theory","author":"D Pr\\r{u}\u0161a","year":"2013","unstructured":"Pr\\r{u}\u0161a, D., Mr\u00e1z, F., Otto, F.: New Results on Deterministic Sgraffito Automata. In: B\u00e9al, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 409\u2013419. Springer, Heidelberg (2013)"},{"issue":"2","key":"24_CR20","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 218(2), 297\u2013323 (1991)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15579-1_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T23:32:41Z","timestamp":1676676761000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15579-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319155784","9783319155791"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15579-1_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 February 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}