{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:36:14Z","timestamp":1725888974254},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319602516"},{"type":"electronic","value":"9783319602523"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-60252-3_2","type":"book-chapter","created":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T10:59:13Z","timestamp":1496401153000},"page":"16-32","source":"Crossref","is-referenced-by-count":3,"title":["Avoiding Overlaps in 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","published-online":{"date-parts":[[2017,6,3]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","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","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. 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":"45","DOI":"10.1007\/978-3-319-23021-4_5","volume-title":"Algebraic Informatics","author":"M Anselmo","year":"2015","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: Unbordered pictures: properties and construction. In: Maletti, A. (ed.) CAI 2015. LNCS, vol. 9270, pp. 45\u201357. Springer, Cham (2015). doi: 10.1007\/978-3-319-23021-4_5"},{"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":"37","key":"2_CR7","doi-asserted-by":"crossref","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":"2_CR8","doi-asserted-by":"crossref","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_CR9","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.tcs.2016.09.025","volume":"657","author":"M Anselmo","year":"2017","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: Non-expandable non-overlapping sets of pictures. Theor. Comput. Sci. 657, 127\u2013136 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1016\/j.ic.2016.06.003","volume":"253","author":"M Anselmo","year":"2017","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: Picture codes and deciphering delay. Inf. Comput. 253, 358\u2013370 (2017)","journal-title":"Inf. Comput."},{"issue":"2","key":"2_CR11","doi-asserted-by":"crossref","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). http:\/\/journals.cambridge.org\/article-S0960129515000043","journal-title":"Math. Struct. Comput. Sci."},{"key":"2_CR12","doi-asserted-by":"crossref","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_CR13","unstructured":"Bajic, D.: On construction of cross-bifix-free kernel sets. In: 2nd MCM COST 2100, Lisbon, Portugal (2007)"},{"issue":"1","key":"2_CR14","doi-asserted-by":"crossref","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. Crypt. Commun. 6(1), 27\u201337 (2014)","journal-title":"Crypt. Commun."},{"key":"2_CR15","doi-asserted-by":"crossref","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_CR16","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.tcs.2016.05.009","volume":"658","author":"E Barcucci","year":"2017","unstructured":"Barcucci, E., Bernini, A., Bilotta, S., Pinzani, R.: Non-overlapping matrices. Theor. Comput. Sci. 658, 36\u201345 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR17","doi-asserted-by":"crossref","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. Theor. Comp. Sci 303, 417\u2013430 (2003)","journal-title":"Theor. Comp. Sci"},{"key":"2_CR18","doi-asserted-by":"crossref","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, Cambridge (2009)"},{"issue":"6","key":"2_CR19","doi-asserted-by":"crossref","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 Trans. Inf. Theory 58(6), 4058\u20134063 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2_CR20","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_CR21","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"},{"issue":"7","key":"2_CR22","doi-asserted-by":"crossref","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 Trans. Inf. Theory 59(7), 4668\u20134674 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"2_CR23","doi-asserted-by":"crossref","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":"2_CR24","doi-asserted-by":"crossref","DOI":"10.1142\/4838","volume-title":"Jewels of Stringology","author":"M Crochemore","year":"2002","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2002). http:\/\/www-igm.univ-mlv.fr\/ mac\/JOS\/JOS.html"},{"issue":"2\u20133","key":"2_CR25","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1142\/S021800149200014X","volume":"6","author":"D Giammarresi","year":"1992","unstructured":"Giammarresi, D., Restivo, A.: Recognizable picture languages. Int. J. Pattern Recognit. Artif. Intell. 6(2\u20133), 241\u2013256 (1992)","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"key":"2_CR26","doi-asserted-by":"crossref","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., Salomaa, A. (eds.) Handbook of Formal Languages, vol. III, pp. 215\u2013268. Springer, Heidelberg (1997)"},{"key":"2_CR27","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"key":"2_CR28","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_CR29","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"},{"issue":"5","key":"2_CR30","doi-asserted-by":"crossref","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. IEEE Trans. Inf. Theory 19(5), 704\u2013706 (1973)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"2_CR31","doi-asserted-by":"crossref","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","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60252-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,9]],"date-time":"2020-10-09T05:31:30Z","timestamp":1602221490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60252-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319602516","9783319602523"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60252-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}