{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T13:49:49Z","timestamp":1775396989317,"version":"3.50.1"},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2002,6]]},"abstract":"<jats:p> We consider the problem of labeling a directed multigraph so that it becomes a synchronized finite automaton, as an ultimate goal to solve the famous Road Coloring Conjecture, cf. [1,2]. We introduce a relabeling method which can be used for a large class of automata to improve their 'degree of synchronization'. This allows, for example, to formulate the conjecture in several equivalent ways. <\/jats:p>","DOI":"10.1142\/s0129054102001217","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:05:54Z","timestamp":1027767954000},"page":"459-471","source":"Crossref","is-referenced-by-count":12,"title":["A NOTE ON SYNCHRONIZED AUTOMATA AND ROAD COLORING PROBLEM"],"prefix":"10.1142","volume":"13","author":[{"suffix":"II","given":"KAREL","family":"CULIK","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of  South Carolina, Columbia, South Carolina 29208, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JUHANI","family":"KARHUM\u00c4KI","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Turku Centre for  Computer Science, University of Turku, FIN-20014 Turku, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JARKKO","family":"KARI","sequence":"additional","affiliation":[{"name":"Department of Computer Science, 14 MacLean Hall,  University of Iowa, Iowa City, Iowa 52242, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02761605"},{"key":"p_3","first-page":"208","volume":"14","author":"Cerny J.","year":"1964","journal-title":"SAV"},{"key":"p_4","first-page":"1133","volume":"110","author":"Friedman J.","year":"1990","journal-title":"Math. Soc."},{"key":"p_6","first-page":"146","volume":"73","author":"Kari J.","year":"2001","journal-title":"EATCS Bull."},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44683-4_38"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01071771"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02762860"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/135\/1185096"},{"key":"p_13","first-page":"535","volume":"17","author":"Pin J.-E.","year":"1983","journal-title":"Annals of Discrete Mathematics"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054102001217","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:34:43Z","timestamp":1565192083000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054102001217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":9,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2002,6]]}},"alternative-id":["10.1142\/S0129054102001217"],"URL":"https:\/\/doi.org\/10.1142\/s0129054102001217","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}