{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:18:25Z","timestamp":1762298305390,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319230207"},{"type":"electronic","value":"9783319230214"}],"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-23021-4_5","type":"book-chapter","created":{"date-parts":[[2015,9,8]],"date-time":"2015-09-08T20:47:30Z","timestamp":1441745250000},"page":"45-57","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Unbordered Pictures: Properties and Construction"],"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,9,9]]},"reference":[{"key":"5_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":"5_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":"5_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)"},{"issue":"2","key":"5_CR4","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":"37","key":"5_CR5","doi-asserted-by":"publisher","first-page":"3520","DOI":"10.1016\/j.tcs.2009.03.016","volume":"410","author":"M Anselmo","year":"2009","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: A computational model for tiling recognizable two-dimensional languages. Theor. Comput. Sci. 410(37), 3520\u20133529 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"5_CR6","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."},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s12095-013-0088-8","volume":"6","author":"D Bajic","year":"2014","unstructured":"Bajic, D., Loncar-Turukalo, T.: A simple suboptimal construction of cross-bifix-free codes. Cryptography and Communications 6(1), 27\u201337 (2014)","journal-title":"Cryptography and Communications"},{"key":"5_CR8","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":"5_CR9","doi-asserted-by":"crossref","unstructured":"Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195768"},{"issue":"6","key":"5_CR10","doi-asserted-by":"publisher","first-page":"4058","DOI":"10.1109\/TIT.2012.2189479","volume":"58","author":"S Bilotta","year":"2012","unstructured":"Bilotta, S., Pergola, E., Pinzani, R.: A new approach to cross-bifix-free sets. IEEE Transactions on Information Theory 58(6), 4058\u20134063 (2012)","journal-title":"IEEE Transactions on Information Theory"},{"key":"5_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":"5_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"},{"issue":"7","key":"5_CR13","doi-asserted-by":"publisher","first-page":"4668","DOI":"10.1109\/TIT.2013.2252952","volume":"59","author":"YM Chee","year":"2013","unstructured":"Chee, Y.M., Kiah, H.M., Purkayastha, P., Wang, C.: Cross-bifix-free codes within a constant factor of optimality. IEEE Transactions on Information Theory 59(7), 4668\u20134674 (2013)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/PL00009200","volume":"20","author":"M Crochemore","year":"1998","unstructured":"Crochemore, M., Iliopoulos, C.S., Korda, M.: Two-dimensional prefix string matching and covering on square matrices. Algorithmica 20(4), 353\u2013373 (1998)","journal-title":"Algorithmica"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Rytter, W.: Jewels of stringology. World Scientific (2002). http:\/\/www-igm.univ-mlv.fr\/ mac\/JOS\/JOS.html","DOI":"10.1142\/4838"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/978-3-319-15579-1_31","volume-title":"Language and Automata Theory and Applications","author":"G Gamard","year":"2015","unstructured":"Gamard, G., Richomme, G.: Coverability in two dimensions. In: Dediu, A.-H., Formenti, E., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 402\u2013413. Springer, Heidelberg (2015)"},{"issue":"2\u20133","key":"5_CR17","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 6(2\u20133), 241\u2013256 (1992)","journal-title":"Pattern Recognition and Artificial Intelligence"},{"key":"5_CR18","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 Verlag (1997)","DOI":"10.1007\/978-3-642-59126-6_4"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574931"},{"key":"5_CR20","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":"5_CR21","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. 7643, pp. 224\u2013235. Springer, Heidelberg (2012)"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Na, J.C., Ferragina, P., Giancarlo, R., Park, K.: Indexed two-dimensional string matching. In: Encyclopedia of Algorithms (2015)","DOI":"10.1007\/978-1-4939-2864-4_442"},{"issue":"5","key":"5_CR23","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1109\/TIT.1973.1055065","volume":"19","author":"PT Nielsen","year":"1973","unstructured":"Nielsen, P.T.: A note on bifix-free sequences (corresp.). IEEE Transactions on Information Theory 19(5), 704\u2013706 (1973)","journal-title":"IEEE Transactions on Information Theory"},{"key":"5_CR24","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\u00edn-Vide, C., Sierra-Rodr\u00edguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol. 8370, pp. 541\u2013552. Springer, Heidelberg (2014)"},{"issue":"9","key":"5_CR25","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."}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23021-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T15:31:19Z","timestamp":1676475079000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23021-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319230207","9783319230214"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23021-4_5","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":"9 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}