{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T04:02:04Z","timestamp":1790049724709,"version":"4.0.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030248857","type":"print"},{"value":"9783030248864","type":"electronic"}],"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-24886-4_5","type":"book-chapter","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T19:02:56Z","timestamp":1563908576000},"page":"74-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Words of Minimum Rank in Deterministic Finite Automata"],"prefix":"10.1007","author":[{"given":"Jarkko","family":"Kari","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew","family":"Ryzhikov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anton","family":"Varonka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,7,10]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-02737-6_5","volume-title":"Developments in Language Theory","author":"J Almeida","year":"2009","unstructured":"Almeida, J., Steinberg, B.: Matrix Mortality and the \u010cern\u00fd-Pin Conjecture. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 67\u201380. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-02737-6_5"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-15155-2_7","volume-title":"Mathematical Foundations of Computer Science 2010","author":"D Ananichev","year":"2010","unstructured":"Ananichev, D., Gusev, V., Volkov, M.: Slowly synchronizing automata and digraphs. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 55\u201365. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-15155-2_7"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.dam.2013.12.002","volume":"169","author":"M B\u00e9al","year":"2014","unstructured":"B\u00e9al, M., Perrin, D.: A quadratic algorithm for road coloring. Discrete Appl. Math. 169, 15\u201329 (2014). \n                      https:\/\/doi.org\/10.1016\/j.dam.2013.12.002","journal-title":"Discrete Appl. Math."},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-319-09698-8_6","volume-title":"Developments in Language Theory","author":"MV Berlinkov","year":"2014","unstructured":"Berlinkov, M.V.: On two algorithmic problems about synchronizing automata. In: Shur, A.M., Volkov, M.V. (eds.) DLT 2014. LNCS, vol. 8633, pp. 61\u201367. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-09698-8_6"},{"key":"5_CR5","series-title":"Classics in Applied Mathematics","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971262","volume-title":"Nonnegative Matrices in the Mathematical Sciences","author":"A Berman","year":"1994","unstructured":"Berman, A., Plemmons, R.: Nonnegative Matrices in the Mathematical Sciences. Classics in Applied Mathematics. Society for Industrial and Applied Mathematics, Philadelphia (1994)"},{"issue":"8","key":"5_CR6","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s00236-009-0106-7","volume":"46","author":"A Carpi","year":"2009","unstructured":"Carpi, A., D\u2019Alessandro, F.: Strongly transitive automata and the \u010dern\u00fd conjecture. Acta Informatica 46(8), 591\u2013607 (2009)","journal-title":"Acta Informatica"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-14455-4_13","volume-title":"Developments in Language Theory","author":"A Carpi","year":"2010","unstructured":"Carpi, A., D\u2019Alessandro, F.: On the hybrid \u010cern\u00fd-Road coloring problem and Hamiltonian paths. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol. 6224, pp. 124\u2013135. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-14455-4_13"},{"issue":"4","key":"5_CR8","first-page":"289","volume":"7","author":"J \u010cern\u00fd","year":"1971","unstructured":"\u010cern\u00fd, J., Pirick\u00e1, A., Rosenauerova, B.: On directable automata. Kybernetika 7(4), 289\u2013298 (1971)","journal-title":"Kybernetika"},{"issue":"3","key":"5_CR9","first-page":"208","volume":"14","author":"J \u010cern\u00fd","year":"1964","unstructured":"\u010cern\u00fd, J.: Poz\u0144amka k homo\u01f5ennym eksperimentom s kone\u010d\u0144ymi automatami, Matematicko-fyzikalny Casopis Slovensk. Akad. Vied 14(3), 208\u2013216 (1964)","journal-title":"Akad. Vied"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s004930170002","volume":"21","author":"R Cole","year":"2001","unstructured":"Cole, R., Ost, K., Schirra, S.: Edge-coloring bipartite multigraphs in \n                      \n                        \n                      \n                      $$O(E \\log D)$$\n                     time. Combinatorica 21(1), 5\u201312 (2001)","journal-title":"Combinatorica"},{"issue":"1\u20133","key":"5_CR11","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 \u010dern\u00fd. RAIRO - Theor. Inform. Appl. 32(1\u20133), 21\u201334 (1998)","journal-title":"RAIRO - Theor. Inform. Appl."},{"issue":"2","key":"5_CR12","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1142\/S0129054113400108","volume":"24","author":"VV Gusev","year":"2013","unstructured":"Gusev, V.V.: Lower bounds for the length of reset words in eulerian automata. Int. J. Found. Comput. Sci. 24(2), 251\u2013262 (2013). \n                      https:\/\/doi.org\/10.1142\/S0129054113400108","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"5_CR13","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1137\/0114052","volume":"14","author":"BR Heap","year":"1966","unstructured":"Heap, B.R., Lynn, M.S.: The structure of powers of nonnegative matrices: I. The index of convergence. SIAM J. Appl. Math. 14(3), 610\u2013639 (1966)","journal-title":"SIAM J. Appl. Math."},{"key":"5_CR14","first-page":"146","volume":"73","author":"J Kari","year":"2001","unstructured":"Kari, J.: A counter example to a conjecture concerning synchronizing words in finite automata. Bull. EATCS 73, 146 (2001)","journal-title":"Bull. EATCS"},{"issue":"1","key":"5_CR15","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. Theor. Comput. Sci. 295(1), 223\u2013232 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"5_CR16","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01071771","volume":"23","author":"AA Klyachko","year":"1987","unstructured":"Klyachko, A.A., Rystsov, I.K., Spivak, M.A.: In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton. Cybernetics 23(2), 165\u2013171 (1987)","journal-title":"Cybernetics"},{"key":"5_CR17","first-page":"535","volume-title":"Combinatorial Mathematics, North-Holland Mathematics Studies","author":"J Pin","year":"1983","unstructured":"Pin, J.: On two combinatorial problems arising from automata theory. In: Berge, C., Bresson, D., Camion, P., Maurras, J., Sterboul, F. (eds.) Combinatorial Mathematics, North-Holland Mathematics Studies, vol. 75, pp. 535\u2013548. North-Holland, Amsterdam (1983)"},{"key":"5_CR18","unstructured":"Pin, J.E.: Le probl\u00e8me de la synchronisation et la conjecture de Cern\u00fd. In: Luca, A.D. (ed.) Non-commutative structures in algebra and geometric combinatorics, vol. 109, pp. 37\u201348. Quaderni de la Ricerca Scientifica, CNR (Consiglio nazionale delle ricerche, Italy) (1981)"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-662-53132-7_31","volume-title":"Developments in Language Theory","author":"M Szyku\u0142a","year":"2016","unstructured":"Szyku\u0142a, M., Vorel, V.: An extremal series of Eulerian synchronizing automata. In: Brlek, S., Reutenauer, C. (eds.) DLT 2016. LNCS, vol. 9840, pp. 380\u2013392. Springer, Heidelberg (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-662-53132-7_31"},{"key":"5_CR20","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). \n                      https:\/\/doi.org\/10.1007\/978-3-540-88282-4_4"},{"issue":"5","key":"5_CR21","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(5), 557\u2013577 (2016). \n                      https:\/\/doi.org\/10.1142\/S0129054116500167","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"5_CR22","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1007\/BF02230720","volume":"52","author":"H Wielandt","year":"1950","unstructured":"Wielandt, H.: Unzerlegbare, nicht negative matrizen. Mathematische Zeitschrift 52(1), 642\u2013648 (1950)","journal-title":"Mathematische Zeitschrift"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24886-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T19:03:14Z","timestamp":1563908594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-24886-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030248857","9783030248864"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24886-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"10 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","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":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2019","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":"dlt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/dlt2019.mimuw.edu.pl\/","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":"EasyChair","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","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)"}}]}}