{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:10:37Z","timestamp":1771024237197,"version":"3.50.1"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031402463","type":"print"},{"value":"9783031402470","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-40247-0_5","type":"book-chapter","created":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T08:02:54Z","timestamp":1691568174000},"page":"79-90","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the\u00a0Smallest Synchronizing Terms of\u00a0Finite Tree Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9165-6280","authenticated-orcid":false,"given":"V\u00e1clav","family":"Bla\u017eej","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9329-1000","authenticated-orcid":false,"given":"Jan","family":"Janou\u0161ek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3783-8870","authenticated-orcid":false,"given":"\u0160t\u011bp\u00e1n","family":"Plach\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,10]]},"reference":[{"key":"5_CR1","unstructured":"Comon, H., et al.: Tree automata techniques and applications (Nov 2008). https:\/\/jacquema.gitlabpages.inria.fr\/files\/tata.pdf"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"46","DOI":"10.3103\/S1066369X10010056","volume":"54","author":"P Martyugin","year":"2010","unstructured":"Martyugin, P.: A lower bound for the length of the shortest carefully synchronizing words. Russian Math. 54, 46\u201354 (2010). https:\/\/doi.org\/10.3103\/S1066369X10010056","journal-title":"Russian Math."},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-38536-0_7","volume-title":"Computer Science \u2013 Theory and Applications","author":"PV Martyugin","year":"2013","unstructured":"Martyugin, P.V.: Careful synchronization of partial automata with restricted alphabets. In: Bulatov, A.A., Shur, A.M. (eds.) CSR 2013. LNCS, vol. 7913, pp. 76\u201387. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38536-0_7"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Pin, J.E.: On two combinatorial problems arising from automata theory. In: Combinatorial Mathematics, North-Holland Mathematics Studies, vol. 75, pp. 535\u2013548. North-Holland (1983). https:\/\/doi.org\/10.1016\/S0304-0208(08)73432-7","DOI":"10.1016\/S0304-0208(08)73432-7"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Pin, J. (ed.): Handbook of Automata Theory. European Mathematical Society Publishing House, Z\u00fcrich, Switzerland (2021). https:\/\/doi.org\/10.4171\/Automata","DOI":"10.4171\/Automata"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/978-3-030-38919-2_47","volume-title":"SOFSEM 2020: Theory and Practice of Computer Science","author":"\u0160 Plach\u00fd","year":"2020","unstructured":"Plach\u00fd, \u0160, Janou\u0161ek, J.: On synchronizing tree automata and their work\u2013optimal parallel run, usable for parallel tree pattern matching. In: Chatzigeorgiou, A., et al. (eds.) SOFSEM 2020. LNCS, vol. 12011, pp. 576\u2013586. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-38919-2_47"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Ruszil, J.: Some results concerning careful synchronization of partial automata and subset synchronization of DFA\u2019s. In: Implementation and Application of Automata, pp. 106\u2013115. Springer International Publishing, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07469-1_8","DOI":"10.1007\/978-3-031-07469-1_8"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/BF01069104","volume":"16","author":"I Rystsov","year":"1980","unstructured":"Rystsov, I.: Asymptotic estimate of the length of a diagnostic word for a finite automaton. Cybern. Syst. Anal. 16, 194\u2013198 (1980). https:\/\/doi.org\/10.1007\/BF01069104","journal-title":"Cybern. Syst. Anal."},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Shabana, H.: Exact synchronization in partial deterministic automata. J. Phys.: Conf. Ser. 1352(1) (Oct 2019). https:\/\/doi.org\/10.1088\/1742-6596\/1352\/1\/012047","DOI":"10.1088\/1742-6596\/1352\/1\/012047"},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Shitov, Y.: An improvement to a recent upper bound for synchronizing words of finite automata. J. Autom. Lang. Comb. 24(2\u20134), 367\u2013373 (2019). https:\/\/doi.org\/10.25596\/jalc-2019-367","DOI":"10.25596\/jalc-2019-367"},{"key":"5_CR11","unstructured":"\u010cern\u00fd, J.: Pozn\u00e1mka k homog\u00e9nnym experimentom s kone\u010dn\u00fdmi automatmi. Matematicko-fyzik\u00e1lny \u010dasopis 14(3), 208\u2013216 (1964). https:\/\/eudml.org\/doc\/29801"},{"key":"5_CR12","unstructured":"\u010cern\u00fd, J., Pirick\u00e1, A., Rosenauerov\u00e1, B.: On directable automata. Kybernetika 07(4), 289\u2013298 (1971). https:\/\/eudml.org\/doc\/28384"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-40247-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T08:08:18Z","timestamp":1691568498000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-40247-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031402463","9783031402470"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-40247-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"10 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Famagusta","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ciaa.emu.edu.tr\/en","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 (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67% - 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 (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}},{"value":"2-3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}