{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T09:56:10Z","timestamp":1721987770880},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3819,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0304-3975(02)00405-x","type":"journal-article","created":{"date-parts":[[2003,2,28]],"date-time":"2003-02-28T19:20:13Z","timestamp":1046460013000},"page":"223-232","source":"Crossref","is-referenced-by-count":79,"title":["Synchronizing finite automata on Eulerian digraphs"],"prefix":"10.1016","volume":"295","author":[{"given":"Jarkko","family":"Kari","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00405-X_BIB1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF02761605","article-title":"Equivalence of topological Markov shifts","volume":"27","author":"Adler","year":"1977","journal-title":"Israel J. Math."},{"key":"10.1016\/S0304-3975(02)00405-X_BIB2","article-title":"Similarity of automorphisms of the torus","volume":"98","author":"Adler","year":"1970","journal-title":"Mem. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(02)00405-X_BIB3","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF02784133","article-title":"Cycles of relatively prime length and the road coloring problem","volume":"123","author":"Carbone","year":"2001","journal-title":"Israel J. Math."},{"key":"10.1016\/S0304-3975(02)00405-X_BIB4","first-page":"208","article-title":"homog\u00e9nnym experimenton s kone\u010dn\u00fdmi automatmi","volume":"14","author":"\u010cern\u00fd","year":"1964","journal-title":"Mat. Fyz. SAV"},{"key":"10.1016\/S0304-3975(02)00405-X_BIB5","unstructured":"K. Culik, J. Karhum\u00e4ki, J. Kari, Synchronized automata and the road coloring problem, TUCS Technical Report 323, Turku Centere for Computer Science, University of Turku, 1999."},{"key":"10.1016\/S0304-3975(02)00405-X_BIB6","doi-asserted-by":"crossref","first-page":"1133","DOI":"10.1090\/S0002-9939-1990-0953004-8","article-title":"On the road coloring problem","volume":"110","author":"Friedman","year":"1990","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(02)00405-X_BIB7","first-page":"209","article-title":"Minimal initializing word","volume":"2","author":"G\u00f6hring","year":"1997","journal-title":"J. Automata, Languages Combin."},{"key":"10.1016\/S0304-3975(02)00405-X_BIB8","first-page":"201","article-title":"Monocyclic decomposition of graphs and the road coloring problem","volume":"110","author":"Jonoska","year":"1995","journal-title":"Congr. Numer."},{"key":"10.1016\/S0304-3975(02)00405-X_BIB9","first-page":"134","article-title":"Many-valued truth functions, \u010cern\u00fd's conjecture and road coloring","volume":"68","author":"Mateescu","year":"1999","journal-title":"EATCS Bull."},{"key":"10.1016\/S0304-3975(02)00405-X_BIB10","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02762860","article-title":"The road coloring problem","volume":"39","author":"O'Brien","year":"1981","journal-title":"Israel J. Math."},{"key":"10.1016\/S0304-3975(02)00405-X_BIB11","series-title":"Symbolic Dynamics and Applications","first-page":"295","article-title":"Synchronizing prefix codes and automata, and the road coloring problem","volume":"Vol. 135","author":"Perrin","year":"1992"},{"key":"10.1016\/S0304-3975(02)00405-X_BIB12","first-page":"85","article-title":"Utilisation de l\u2019alg\u00e8bre lin\u00e9aire en th\u00e9orie des automates","volume":"II","author":"Pin","year":"1972","journal-title":"Act. Collouq. AFCET-SMF Math. Appl."},{"key":"10.1016\/S0304-3975(02)00405-X_BIB13","unstructured":"J.-E. Pin, Le probl\u00e8me de la synchronisation, contribution \u00e0 l\u2019\u00e9tudia de la conjecture de \u010cern\u00fd, Th\u00e8se, 3e cycle, Universit\u00e9 Paris, 1978."},{"key":"10.1016\/S0304-3975(02)00405-X_BIB14","first-page":"535","article-title":"On two combinatorial problems arising from automata theory","volume":"17","author":"Pin","year":"1983","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0304-3975(02)00405-X_BIB15","unstructured":"A. Salomaa, Synchronization of finite automata. Contributions to an old problem, Turku Centere for Computer Science, Technical Report, Vol. 365, 2000."},{"key":"10.1016\/S0304-3975(02)00405-X_BIB16","series-title":"Introduction to Graph Theory","author":"West","year":"1996"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750200405X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750200405X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T12:20:09Z","timestamp":1553948409000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750200405X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S030439750200405X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00405-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}