{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T21:41:10Z","timestamp":1794346870962,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540434535","type":"print"},{"value":"9783540460114","type":"electronic"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-46011-x_14","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T18:54:16Z","timestamp":1182192856000},"page":"175-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Note on Synchronized Automata and Road Coloring Problem"],"prefix":"10.1007","author":[{"suffix":"II","given":"Karel","family":"Culik","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juhani","family":"Karhum\u00e4ki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jarkko","family":"Kari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,3,19]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02761605","volume":"27","author":"R. L. Adler","year":"1977","unstructured":"R. L. Adler, L.W. Goodwyn and B. Weiss, Equivalence of Topological Markov Shifts, Israel J. Math. 27, 49\u201363, (1977).","journal-title":"Israel J. Math."},{"key":"14_CR2","unstructured":"M.-P. Beal and D. Perrin, Symbolic Dynamics and Finite automata, in: G. Rozenberg and A. Salomaa (eds.) Handbook of Formal Languages Vol II, 49\u201363, (1997)."},{"key":"14_CR3","first-page":"208","volume":"14","author":"J. \u010cern\u00ed","year":"1964","unstructured":"J. \u010cern\u00ed, Pozn\u00e1mka k homogennym experimenton s kone\u010dn\u00fdmi automatmi, Mat. fyz. \u010das. SAV 14, 208\u2013215, (1964).","journal-title":"Mat. fyz. \u010das. SAV"},{"key":"14_CR4","first-page":"1133","volume":"110","author":"J. Friedman","year":"1990","unstructured":"J. Friedman On the road coloring problem, Math. Soc. 110, 1133\u20131135, (1990).","journal-title":"Math. Soc."},{"key":"14_CR5","unstructured":"J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, (Addison-Wesley 1979)."},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01071771","volume":"23","author":"A. Kljachko","year":"1987","unstructured":"A. Kljachko, I. Rystsow and K. Spivak, Extended combinatorial problem concerning the length of the reset word in a finite automaton, Cybernetics 23, 165\u2013170, (1987).","journal-title":"Cybernetics"},{"key":"14_CR7","first-page":"146","volume":"73","author":"J. Kari","year":"2001","unstructured":"J. Kari, A counter example to a conjecture concerning synchronized words in finite automata, EATCS Bull. 73, 146, (2001).","journal-title":"EATCS Bull."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"D. Lind and B. Marcus, An Introduction of Symbolic Dynamics and Coding, (Cambridge Univ. Press, 1995).","DOI":"10.1017\/CBO9780511626302"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02762860","volume":"39","author":"G. L. O\u2019Brien","year":"1981","unstructured":"G. L. O\u2019 Brien, The road coloring problem, Israel J. Math. 39, 145\u2013154, (1981).","journal-title":"Israel J. Math."},{"key":"14_CR10","unstructured":"D. Perrin and M.P. Sch\u00fczenberger, Synchronizing prefix codes and automata and the road coloring problem, in: P. Walters (ed.) Symbolic Dynamics and its Applications, Contemporary Mathematics 135, 295\u2013318, (1991)."},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"J.-E. Pin, Le probleme de la conjecture de \u010cern\u00fd, These de 3\n                    e\n                   cycle, Universite de Paris VI (1978).","DOI":"10.1007\/3-540-08860-1_25"},{"key":"14_CR12","first-page":"535","volume":"17","author":"J.-E. Pin","year":"1983","unstructured":"J.-E. Pin, On two combinatorial problems arising from automata theory, Annals of Discrete Mathematics 17, 535\u2013548, (1983).","journal-title":"Annals of Discrete Mathematics"}],"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\/3-540-46011-X_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T09:12:40Z","timestamp":1580289160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46011-X_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434535","9783540460114"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-46011-x_14","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/3-540-46011-x","asserted-by":"object"}]},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"19 March 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}