{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T02:09:01Z","timestamp":1748052541558,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319948119"},{"type":"electronic","value":"9783319948126"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-94812-6_8","type":"book-chapter","created":{"date-parts":[[2018,6,28]],"date-time":"2018-06-28T22:12:26Z","timestamp":1530223946000},"page":"84-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Synchronizing Random Almost-Group Automata"],"prefix":"10.1007","author":[{"given":"Mikhail V.","family":"Berlinkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyril","family":"Nicaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,29]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Belinkov, M., Nicaud, C.: Synchronizing random almost-group automata (2018). https:\/\/arxiv.org\/abs\/1805.02154","DOI":"10.1007\/978-3-319-94812-6_8"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-319-29221-2_7","volume-title":"Algorithms and Discrete Applied Mathematics","author":"MV Berlinkov","year":"2016","unstructured":"Berlinkov, M.V.: On the probability of being synchronizable. In: Govindarajan, S., Maheshwari, A. (eds.) CALDAM 2016. LNCS, vol. 9602, pp. 73\u201384. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29221-2_7"},{"issue":"3","key":"8_CR3","first-page":"208","volume":"14","author":"J \u010cern\u00fd","year":"1964","unstructured":"\u010cern\u00fd, J.: Pozn\u00e1mka k homog\u00e9nnym eksperimentom s kone\u010dn\u00fdmi automatami. Matem.-fyzik. \u010casopis Slovenskej Akad\u00e9mie Vied 14(3), 208\u2013216 (1964)","journal-title":"Matem.-fyzik. \u010casopis Slovenskej Akad\u00e9mie Vied"},{"issue":"2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"270","DOI":"10.3217\/jucs-008-02-0270","volume":"8","author":"J Kari","year":"2002","unstructured":"Kari, J.: Synchronization and stability of finite automata. J. UCS 8(2), 270\u2013277 (2002). https:\/\/doi.org\/10.3217\/jucs-008-02-0270","journal-title":"J. UCS"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-662-44522-8_2","volume":"2014","author":"C Nicaud","year":"2014","unstructured":"Nicaud, C.: Random deterministic automata. Math. Found. of Comp. Sci. 2014, 5\u201323 (2014). https:\/\/doi.org\/10.1007\/978-3-662-44522-8_2","journal-title":"Math. Found. of Comp. Sci."},{"key":"8_CR6","unstructured":"Nicaud, C.: Fast synchronization of random automata. In: APPROX\/RANDOM 2016. Leibniz International Proceedings in Informatics (LIPIcs), vol. 60, pp. 43:1\u201343:12 (2016)"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/S0304-0208(08)73432-7","volume-title":"Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics","author":"J.E. Pin","year":"1983","unstructured":"Pin, J.E.: On two combinatorial problems arising from automata theory. In: Proceedings of the International Colloquium on Graph Theory and Combinatorics, vol. 75, pp. 535\u2013548 (1983)"},{"key":"8_CR8","unstructured":"Szykula, M.: Improving the upper bound on the length of the shortest reset word. In: 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018). LIPIcs, vol. 96, pp. 56:1\u201356:13 (2018)"},{"issue":"1","key":"8_CR9","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s11856-009-0062-5","volume":"172","author":"A Trahtman","year":"2009","unstructured":"Trahtman, A.: The road coloring problem. Israel J. Math. 172(1), 51\u201360 (2009). https:\/\/doi.org\/10.1007\/s11856-009-0062-5","journal-title":"Israel J. Math."},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-88282-4_4","volume-title":"Language and Automata Theory and Applications","author":"MV Volkov","year":"2008","unstructured":"Volkov, M.V.: Synchronizing automata and the \u010cern\u00fd conjecture. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 11\u201327. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88282-4_4"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Zaks, Y., Skvortsov, E.: Synchronizing random automata. Discrete Math. Theor. Comput. Sci. 12(4) (2010)","DOI":"10.46298\/dmtcs.514"}],"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-319-94812-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:45:33Z","timestamp":1709826333000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94812-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319948119","9783319948126"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94812-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 June 2018","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":"Charlottetown, PE","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.smcs.upei.ca\/ciaa2018","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}