{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:13:42Z","timestamp":1743081222204,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319986531"},{"type":"electronic","value":"9783319986548"}],"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-98654-8_27","type":"book-chapter","created":{"date-parts":[[2018,8,4]],"date-time":"2018-08-04T23:43:57Z","timestamp":1533426237000},"page":"330-341","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Completely Reachable Automata and Subset Reachability"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Gonze","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rapha\u00ebl M.","family":"Jungers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,5]]},"reference":[{"issue":"2","key":"27_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.4171\/EMSS\/4-2-1","volume":"4","author":"J Ara\u00fajo","year":"2017","unstructured":"Ara\u00fajo, J., Cameron, P.J., Steinberg, B.: Between primitive and 2-transitive: synchronization and its friends. EMS Surv. Math. Sci. 4(2), 101\u2013184 (2017)","journal-title":"EMS Surv. Math. Sci."},{"issue":"2","key":"27_CR2","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1142\/S0129054111008039","volume":"22","author":"M-P B\u00e9al","year":"2011","unstructured":"B\u00e9al, M.-P., Berlinkov, M.V., Perrin, D.: A quadratic upper bound on the size of a synchronizing word in one-cluster automata. Int. J. Found. Comput. Sci. 22(2), 277\u2013288 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"27_CR3","unstructured":"Berlinkov, M.V., Ferens, R., Szyku\u0142a, M.: Complexity of preimage problems for deterministic finite automata. arXiv preprint arXiv:1704.08233 (2017)"},{"key":"27_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511777653","volume-title":"Combinatorics, Automata and Number Theory","author":"V Berth\u00e9","year":"2010","unstructured":"Berth\u00e9, V., Rigo, M.: Combinatorics, Automata and Number Theory, vol. 135. Cambridge University Press, Cambridge (2010)"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.automatica.2015.07.026","volume":"61","author":"V Blondel","year":"2015","unstructured":"Blondel, V., Jungers, R.M., Olshevsky, A.: On primitivity of sets of matrices. Automatica 61, 80\u201388 (2015)","journal-title":"Automatica"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-41114-9_1","volume-title":"Descriptional Complexity of Formal Systems","author":"EA Bondar","year":"2016","unstructured":"Bondar, E.A., Volkov, M.V.: Completely reachable automata. In: C\u00e2mpeanu, C., Manea, F., Shallit, J. (eds.) DCFS 2016. LNCS, vol. 9777, pp. 1\u201317. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41114-9_1"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Bondar, E.A., Volkov, M.V.: A characterization of completely reachable automata. arXiv preprint arXiv:1805.02879 (2018)","DOI":"10.1007\/978-3-319-98654-8_12"},{"key":"27_CR8","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. Matematicko-fysikalny Casopis SAV 14, 208\u2013216 (1964)","journal-title":"Matematicko-fysikalny Casopis SAV"},{"key":"27_CR9","first-page":"289","volume":"7","author":"J \u010cern\u00fd","year":"1971","unstructured":"\u010cern\u00fd, J., Pirick\u00e1, A., Rosenauerova, B.: On directable automata. Kybernetica 7, 289\u2013298 (1971)","journal-title":"Kybernetica"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Chevalier, P.-Y., Hendrickx, J.M., Jungers, R.M.: Reachability of consensus and synchronizing automata. In: 2015 IEEE 54th Annual Conference on Decision and Control, CDC, pp. 4139\u20134144. IEEE (2015)","DOI":"10.1109\/CDC.2015.7402864"},{"issue":"3","key":"27_CR11","first-page":"3","volume":"23","author":"H Don","year":"2016","unstructured":"Don, H.: The \u010cern\u00fd conjecture and 1-contracting automata. Electron. J. Comb. 23(3), 3\u201312 (2016)","journal-title":"Electron. J. Comb."},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1051\/ita\/1998321-300211","volume":"32","author":"L Dubuc","year":"1998","unstructured":"Dubuc, L.: Sur les automates circulaires et la conjecture de \u010cern\u00fd. RAIRO Informatique Theorique et Appliqu\u00e9e 32, 21\u201334 (1998)","journal-title":"RAIRO Informatique Theorique et Appliqu\u00e9e"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-319-62809-7_13","volume-title":"Developments in Language Theory","author":"F Gonze","year":"2017","unstructured":"Gonze, F., Gusev, V.V., Gerencs\u00e9r, B., Jungers, R.M., Volkov, M.V.: On the interplay between Babai and \u010cern\u00fd\u2019s conjectures. In: Charlier, \u00c9., Leroy, J., Rigo, M. (eds.) DLT 2017. LNCS, vol. 10396, pp. 185\u2013197. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62809-7_13"},{"issue":"2","key":"27_CR14","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1137\/15M1024603","volume":"30","author":"F Gonze","year":"2016","unstructured":"Gonze, F., Jungers, R.M.: On the synchronizing probability function and the triple rendezvous time for synchronizing automata. SIAM J. Discret. Math. 30(2), 995\u20131014 (2016)","journal-title":"SIAM J. Discret. Math."},{"key":"27_CR15","first-page":"307","volume":"17","author":"F Gonze","year":"2015","unstructured":"Gonze, F., Jungers, R.M., Trahtman, A.N.: A note on a recent attempt to improve the Pin-Frankl bound. Discret. Math. Theoret. Comput. Sci. 17, 307\u2013308 (2015)","journal-title":"Discret. Math. Theoret. Comput. Sci."},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0304-3975(02)00405-X","volume":"295","author":"J Kari","year":"2003","unstructured":"Kari, J.: Synchronizing finite automata on Eulerian digraphs. Theoret. Comput. Sci. 295, 223\u2013232 (2003)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"27_CR17","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1515\/156939203322556045","volume":"13","author":"AE Kirnasov","year":"2003","unstructured":"Kirnasov, A.E.: On glueing states of an automaton. Discret. Math. Appl. DMA 13(4), 371\u2013389 (2003)","journal-title":"Discret. Math. Appl. DMA"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Lower bounds for natural proof systems. In: 1977 18th Annual Symposium on Foundations of Computer Science, pp. 254\u2013266. IEEE (1977)","DOI":"10.1109\/SFCS.1977.16"},{"key":"27_CR19","volume-title":"An Introduction to Formal Languages and Automata","author":"P Linz","year":"2011","unstructured":"Linz, P.: An Introduction to Formal Languages and Automata. Jones & Bartlett Publishers, Burlington (2011)"},{"key":"27_CR20","first-page":"129","volume":"34","author":"EF Moore","year":"1956","unstructured":"Moore, E.F.: Gedanken-experiments on sequential machines. Ann. Math. Stud. 34, 129\u2013153 (1956)","journal-title":"Ann. Math. Stud."},{"issue":"3","key":"27_CR21","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF02732984","volume":"36","author":"IK Rystsov","year":"2000","unstructured":"Rystsov, I.K.: Estimation of the length of reset words for automata with simple idempotents. Cybern. Syst. Anal. 36(3), 339\u2013344 (2000)","journal-title":"Cybern. Syst. Anal."},{"key":"27_CR22","doi-asserted-by":"publisher","first-page":"1697","DOI":"10.1142\/S0129054111008970","volume":"22","author":"B Steinberg","year":"2011","unstructured":"Steinberg, B.: The averaging trick and the \u010cern\u00fd conjecture. Int. J. Found. Comput. Sci. 22, 1697\u20131706 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"27_CR23","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. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"issue":"2","key":"27_CR24","first-page":"3","volume":"9","author":"AN Trahtman","year":"2007","unstructured":"Trahtman, A.N.: The \u010cern\u00fd conjecture for aperiodic automata. Discret. Math. Theoret. Comput. Sci. 9(2), 3\u201310 (2007)","journal-title":"Discret. Math. Theoret. Comput. Sci."},{"key":"27_CR25","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"},{"issue":"05","key":"27_CR26","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0129054116500167","volume":"27","author":"V Vorel","year":"2016","unstructured":"Vorel, V.: Subset synchronization and careful synchronization of binary finite automata. Int. J. Found. Comput. Sci. 27(05), 557\u2013577 (2016)","journal-title":"Int. J. Found. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98654-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,28]],"date-time":"2022-08-28T19:44:54Z","timestamp":1661715894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98654-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319986531","9783319986548"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98654-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}