{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:33:21Z","timestamp":1742913201077,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"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_30","type":"book-chapter","created":{"date-parts":[[2019,2,13]],"date-time":"2019-02-13T15:18:36Z","timestamp":1550071116000},"page":"409-420","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Note with Computer Exploration on the Triangle Conjecture"],"prefix":"10.1007","author":[{"given":"Christophe","family":"Cordero","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,14]]},"reference":[{"key":"30_CR1","volume-title":"Codes and Automata","author":"J Berstel","year":"2010","unstructured":"Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata, vol. 129. Cambridge University Press, Cambridge (2010)"},{"issue":"7\u20138","key":"30_CR2","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s00236-013-0187-1","volume":"50","author":"C Felice De","year":"2013","unstructured":"De Felice, C.: A note on the factorization conjecture. Acta Informatica 50(7\u20138), 381\u2013402 (2013)","journal-title":"Acta Informatica"},{"issue":"3","key":"30_CR3","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0012-365X(82)90156-X","volume":"39","author":"G Hansel","year":"1982","unstructured":"Hansel, G.: Baionnettes et cardinaux. Discrete Math. 39(3), 331\u2013335 (1982)","journal-title":"Discrete Math."},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/3-540-08138-0_23","volume-title":"Lecture Notes in Computer Science","author":"D. Perrin","year":"1977","unstructured":"Perrin, D., Sch\u00fctzenberger, M.-P.: Codes et sous-mono\u00efdes poss\u00e9dant des mots neutres. In: Theoretical Computer Science. LNCS, vol. 48, pp. 270\u2013281. Springer, Heidelberg (1977). \n                      https:\/\/doi.org\/10.1007\/3-540-08138-0_23"},{"issue":"2","key":"30_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1051\/ita\/1989230201351","volume":"23","author":"A Restivo","year":"1989","unstructured":"Restivo, A., Salemi, S., Sportelli, T.: Completing codes. RAIRO-Theoret. Inf. Appl. 23(2), 135\u2013147 (1989)","journal-title":"RAIRO-Theoret. Inf. Appl."},{"issue":"3","key":"30_CR6","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1112\/S0024609300007189","volume":"32","author":"AD Sands","year":"2000","unstructured":"Sands, A.D.: Replacement of factors by subgroups in the factorization of abelian groups. Bull. Lond. Math. Soc. 32(3), 297\u2013304 (2000)","journal-title":"Bull. Lond. Math. Soc."},{"key":"30_CR7","unstructured":"Sardinas, A.A., Patterson, G.W.: A necessary and sufficient condition for unique decomposition of coded messages. In: Proceedings of the Institute of Radio Engineers, vol. 41, no. 3, pp. 425\u2013425 (1953)"},{"issue":"1","key":"30_CR8","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/0097-3165(85)90032-9","volume":"38","author":"PW Shor","year":"1985","unstructured":"Shor, P.W.: A counterexample to the triangle conjecture. J. Comb. Theory Ser. A 38(1), 110\u2013112 (1985)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"3","key":"30_CR9","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1016\/j.disc.2016.10.008","volume":"340","author":"L Zhang","year":"2017","unstructured":"Zhang, L., Shum, K.P.: Finite maximal codes and triangle conjecture. Discrete Math. 340(3), 541\u2013549 (2017)","journal-title":"Discrete Math."}],"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_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:48:10Z","timestamp":1558478890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-13435-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030134341","9783030134358"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-13435-8_30","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"}}]}}