{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T06:52:40Z","timestamp":1719903160024},"reference-count":10,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,6,1]],"date-time":"2015-06-01T00:00:00Z","timestamp":1433116800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"name":"Iuventus Plus","award":["IP2012 052272"],"award-info":[{"award-number":["IP2012 052272"]}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1016\/j.ic.2015.04.004","type":"journal-article","created":{"date-parts":[[2015,4,10]],"date-time":"2015-04-10T16:14:57Z","timestamp":1428682497000},"page":"383-393","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["A complete solution to the complexity of Synchronizing Road Coloring for non-binary alphabets"],"prefix":"10.1016","volume":"242","author":[{"given":"A.","family":"Roman","sequence":"first","affiliation":[]},{"given":"M.","family":"Drewienkowski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ic.2015.04.004_br0010","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":"Isr. J. Math."},{"key":"10.1016\/j.ic.2015.04.004_br0020","article-title":"Similarity of Automorphisms of the Torus","volume":"vol. 98","author":"Adler","year":"1970"},{"key":"10.1016\/j.ic.2015.04.004_br0030","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.dam.2013.12.002","article-title":"A quadratic algorithm for road coloring","volume":"169","author":"B\u00e9al","year":"2014","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.ic.2015.04.004_br0040","doi-asserted-by":"crossref","first-page":"49","DOI":"10.17223\/20710410\/12\/4","article-title":"On the error of the polynomial computation of an optimal coloring of a graph into a synchronizing automaton","volume":"2","author":"Berlinkov","year":"2011","journal-title":"Prikl. Diskretn. Mat."},{"key":"10.1016\/j.ic.2015.04.004_br0050","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1137\/0219033","article-title":"Reset sequences for monotonic automata","volume":"19","author":"Eppstein","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.ic.2015.04.004_br0060","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/j.ipl.2010.12.016","article-title":"NP-completeness of the road coloring problem","volume":"111","author":"Roman","year":"2011","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.ic.2015.04.004_br0070","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s11856-009-0062-5","article-title":"Road coloring problem","volume":"172","author":"Trahtman","year":"2009","journal-title":"Isr. J. Math."},{"key":"10.1016\/j.ic.2015.04.004_br0080","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/978-3-642-25011-8_28","article-title":"An algorithm for road coloring","volume":"7056","author":"Trahtman","year":"2011","journal-title":"Lect. Notes Comput. Sci."},{"key":"10.1016\/j.ic.2015.04.004_br0090","series-title":"Conference \u2018Around the \u010cern\u00fd Conjecture\u2019","article-title":"Open problems on synchronizing automata","author":"Volkov","year":"2008"},{"key":"10.1016\/j.ic.2015.04.004_br0100","series-title":"Tutorial on Workshop on Algebra, Combinatorics and Complexity","article-title":"Synchronizing automata and the road coloring theorem","author":"Volkov","year":"2008"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540115000462?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540115000462?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,8,23]],"date-time":"2019-08-23T03:09:12Z","timestamp":1566529752000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540115000462"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":10,"alternative-id":["S0890540115000462"],"URL":"https:\/\/doi.org\/10.1016\/j.ic.2015.04.004","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2015,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A complete solution to the complexity of Synchronizing Road Coloring for non-binary alphabets","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ic.2015.04.004","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}