{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:49Z","timestamp":1760202709362,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319586304"},{"type":"electronic","value":"9783319586311"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-58631-1_2","type":"book-chapter","created":{"date-parts":[[2017,5,5]],"date-time":"2017-05-05T02:26:03Z","timestamp":1493951163000},"page":"19-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Infinite Two-Dimensional Strong Prefix Codes: Characterization and Properties"],"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":[[2017,5,6]]},"reference":[{"key":"2_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. Theoret. Comput. Sci. 147, 165\u2013180 (1995)","journal-title":"Theoret. Comput. Sci."},{"issue":"2\u20133","key":"2_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":"2_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). doi:10.1007\/978-3-642-40663-8_6"},{"key":"2_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). doi:10.1007\/978-3-642-38771-5_6"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-319-15579-1_24","volume-title":"Language and Automata Theory and Applications","author":"M Anselmo","year":"2015","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: Structure and measure of a decidable class of two-dimensional codes. In: Dediu, A.-H., Formenti, E., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 315\u2013327. Springer, Cham (2015). doi:10.1007\/978-3-319-15579-1_24"},{"issue":"2","key":"2_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. ITA 40(2), 227\u2013294 (2006)","journal-title":"ITA"},{"issue":"8","key":"2_CR7","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1142\/S0129054114400218","volume":"25","author":"M Anselmo","year":"2014","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: Prefix picture codes: a decidable class of two-dimensional codes. Int. J. Found. Comput. Sci. 25(8), 1017\u20131032 (2014)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: Picture codes and deciphering delay. Information and Computation (2017, in press)","DOI":"10.1016\/j.ic.2016.06.003"},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1017\/S0960129515000043","volume":"27","author":"M Anselmo","year":"2017","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: Structure and properties of strong prefix codes of pictures. Math. Struct. Comput. Sci. 27(2), 123\u2013142 (2017)","journal-title":"Math. Struct. Comput. Sci."},{"key":"2_CR10","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. 5404, pp. 79\u201392. Springer, Heidelberg (2009). doi:10.1007\/978-3-540-95891-8_11"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.tcs.2016.06.016","volume":"658","author":"M Anselmo","year":"2017","unstructured":"Anselmo, M., Madonia, M.: Two-dimensional comma-free and cylindric codes. Theor. Comput. Sci. 658, 4\u201317 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.tcs.2015.08.032","volume":"664","author":"E Barcucci","year":"2017","unstructured":"Barcucci, E., Bernini, A., Bilotta, S., Pinzani, R.: Cross-bifix-free sets in two dimensions. Theor. Comput. Sci. 664, 29\u201338 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR13","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":"2_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195768","volume-title":"Codes and Automata","author":"J Berstel","year":"2009","unstructured":"Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press, New York (2009)"},{"key":"2_CR15","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":"2_CR16","first-page":"537","volume":"40","author":"S Bozapalidis","year":"2006","unstructured":"Bozapalidis, S., Grammatikopoulou, A.: Picture codes. ITA 40(4), 537\u2013550 (2006)","journal-title":"ITA"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-59126-6_4","volume-title":"Handbook of Formal Languages","author":"D Giammarresi","year":"1997","unstructured":"Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G. (ed.) Handbook of Formal Languages, vol. III, pp. 215\u2013268. Springer, Heidelberg (1997)"},{"key":"2_CR18","unstructured":"Grammatikopoulou, A.: Prefix picture sets and picture codes. In: Proceedings of the CAI 2005, pp. 255\u2013268. Aristotle University of Thessaloniki (2005)"},{"key":"2_CR19","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). doi:10.1007\/978-3-642-24897-9_9"},{"key":"2_CR20","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: Arumugam, S., Smyth, W.F. (eds.) IWOCA 2012. LNCS, vol. 7643, pp. 224\u2013235. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-35926-2_25"},{"key":"2_CR21","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.J. (eds.) COCOON 2004. LNCS, vol. 3106, pp. 72\u201381. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-27798-9_10"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Otto, F., Mr\u00e1z, F.: Deterministic ordered restarting automata for picture languages. Acta Inf. 52(7\u20138), 593\u2013623 (2015)","DOI":"10.1007\/s00236-015-0230-5"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Pradella, M., Cherubini, A., Crespi-Reghizzi, S.: A unifying approach to picture grammars. Inf. Comput. 209(9), 1246\u20131267 (2011)","DOI":"10.1016\/j.ic.2011.07.001"},{"issue":"2","key":"2_CR24","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. Theoret. Comput. Sci. 218(2), 297\u2013323 (1991)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Cellular Automata and Discrete Complex Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58631-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T00:03:09Z","timestamp":1621814589000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-58631-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319586304","9783319586311"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58631-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"6 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AUTOMATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Cellular Automata and Discrete Complex Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"automata2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/automata2017.disco.unimib.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}