{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:29:16Z","timestamp":1762298956744,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030134341"},{"type":"electronic","value":"9783030134358"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-13435-8_21","type":"book-chapter","created":{"date-parts":[[2019,2,13]],"date-time":"2019-02-13T15:18:36Z","timestamp":1550071116000},"page":"288-301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Toroidal Codes and Conjugate Pictures"],"prefix":"10.1007","author":[{"given":"Marcella","family":"Anselmo","sequence":"first","affiliation":[]},{"given":"Maria","family":"Madonia","sequence":"additional","affiliation":[]},{"given":"Carla","family":"Selmi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,14]]},"reference":[{"key":"21_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. Theor. Comput. Sci. 147, 165\u2013180 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR2","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). \n                      https:\/\/doi.org\/10.1007\/978-3-642-40663-8_6"},{"key":"21_CR3","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). \n                      https:\/\/doi.org\/10.1007\/978-3-642-38771-5_6"},{"issue":"8","key":"21_CR4","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":"21_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). \n                      https:\/\/doi.org\/10.1007\/978-3-319-23021-4_5"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-319-60252-3_2","volume-title":"Descriptional Complexity of Formal Systems","author":"M Anselmo","year":"2017","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: Avoiding overlaps in pictures. In: Pighizzini, G., C\u00e2mpeanu, C. (eds.) DCFS 2017. LNCS, vol. 10316, pp. 16\u201332. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-60252-3_2"},{"key":"21_CR7","doi-asserted-by":"publisher","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":"21_CR8","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":"21_CR9","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":"21_CR10","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1186\/1748-7188-9-9","volume":"9","author":"C Barton","year":"2014","unstructured":"Barton, C., Iliopoulos, C.S., Pissis, S.P.: Fast algorithms for approximate circular string matching. Algorithms Mol. Biol. 9, 9 (2014)","journal-title":"Algorithms Mol. Biol."},{"key":"21_CR11","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, Cambridge (2009)"},{"issue":"4","key":"21_CR12","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":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-319-13749-0_15","volume-title":"Theory and Practice of Natural Computing","author":"C Felice De","year":"2014","unstructured":"De Felice, C., Zaccagnino, R., Zizza, R.: Unavoidable sets and regularity of languages generated by (1, 3)-circular splicing systems. In: Dediu, A.-H., Lozano, M., Mart\u00edn-Vide, C. (eds.) TPNC 2014. LNCS, vol. 8890, pp. 169\u2013180. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-13749-0_15"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.tcs.2016.09.008","volume":"658","author":"C Felice De","year":"2017","unstructured":"De Felice, C., Zaccagnino, R., Zizza, R.: Unavoidable sets and circular splicing languages. Theor. Comput. Sci. 658, 148\u2013158 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.ipl.2016.09.011","volume":"118","author":"G Gamard","year":"2017","unstructured":"Gamard, G., Richomme, G., Shallit, J., Smith, T.J.: Periodicity in rectangular arrays. Inf. Process. Lett. 118, 58\u201363 (2017)","journal-title":"Inf. Process. Lett."},{"key":"21_CR16","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., Salomaa, A. (eds.) Handbook of Formal Languages, vol. III, pp. 215\u2013267. Springer, Heidelberg (1997). \n                      https:\/\/doi.org\/10.1007\/978-3-642-59126-6_4"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-319-53733-7_11","volume-title":"Language and Automata Theory and Applications","author":"MS Kulkarni","year":"2017","unstructured":"Kulkarni, M.S., Mahalingam, K.: Two-dimensional palindromes and their properties. In: Drewes, F., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2017. LNCS, vol. 10168, pp. 155\u2013167. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-53733-7_11"},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.tcs.2012.11.018","volume":"468","author":"T Lee","year":"2013","unstructured":"Lee, T., Na, J.C., Park, H., Park, K., Sim, J.S.: Finding consensus and optimal alignment of circular strings. Theor. Comput. Sci. 468, 92\u2013101 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on Words","author":"M Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on Words. Cambridge University Press, Cambridge (1997)"},{"issue":"1","key":"21_CR20","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/s00453-015-0065-z","volume":"77","author":"S Marcus","year":"2017","unstructured":"Marcus, S., Sokol, D.: 2D Lyndon words and applications. Algorithmica 77(1), 116\u2013133 (2017)","journal-title":"Algorithmica"},{"key":"21_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). \n                      https:\/\/doi.org\/10.1007\/978-3-540-27798-9_10"},{"doi-asserted-by":"crossref","unstructured":"Perrin, D., Restivo, A.: Enumerative combinatorics on words. In: Bona, M. (ed.) Handbook of Enumerative Combinatorics. CRC Press (2015)","key":"21_CR22","DOI":"10.1201\/b18255-11"},{"issue":"2","key":"21_CR23","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. Theor. Comput. Sci. 218(2), 297\u2013323 (1991)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-13435-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:47:42Z","timestamp":1558478862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-13435-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030134341","9783030134358"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-13435-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Language and Automata Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Petersburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lata2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lata2019.irdta.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"98","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"6-7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}