{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T02:09:33Z","timestamp":1780106973571,"version":"3.54.0"},"reference-count":36,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T00:00:00Z","timestamp":1775606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.ejc.2026.104388","type":"journal-article","created":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T12:12:42Z","timestamp":1776168762000},"page":"104388","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The hereditariness problem for the \u010cern\u00fd conjecture"],"prefix":"10.1016","volume":"136","author":[{"given":"Emanuele","family":"Rodaro","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Riccardo","family":"Venturi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.ejc.2026.104388_b1","doi-asserted-by":"crossref","first-page":"1429","DOI":"10.1090\/S0002-9947-08-04712-0","article-title":"Representation theory of finite semigroups, semigroup radicals and formal language theory","volume":"361","author":"Almeida","year":"2009","journal-title":"Trans. Amer. Math. Soc.","ISSN":"https:\/\/id.crossref.org\/issn\/0002-9947","issn-type":"print"},{"issue":"02","key":"10.1016\/j.ejc.2026.104388_b2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1142\/S0129054116400037","article-title":"Semisimple synchronizing automata and the Wedderburn-Artin theory","volume":"27","author":"Almeida","year":"2016","journal-title":"Internat. J. Found. Comput. Sci."},{"issue":"6","key":"10.1016\/j.ejc.2026.104388_b3","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1112\/plms\/pdw040","article-title":"Primitive groups, graph endomorphisms and synchronization","volume":"113","author":"Ara\u00fajo","year":"2016","journal-title":"Proc. Lond. Math. Soc."},{"issue":"1","key":"10.1016\/j.ejc.2026.104388_b4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.tcs.2006.02.003","article-title":"Synchronizing groups and automata","volume":"359","author":"Arnold","year":"2006","journal-title":"Theoret. Comput. Sci.","ISSN":"https:\/\/id.crossref.org\/issn\/0304-3975","issn-type":"print"},{"issue":"02","key":"10.1016\/j.ejc.2026.104388_b5","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1142\/S0129054111008039","article-title":"A quadratic upper bound on the size of a synchronizing word in one-cluster automata","volume":"22","author":"B\u00e9al","year":"2011","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/j.ejc.2026.104388_b6","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2023.103812","article-title":"Unambiguously coded shifts","volume":"119","author":"B\u00e9al","year":"2024","journal-title":"European J. Combin.","ISSN":"https:\/\/id.crossref.org\/issn\/0195-6698","issn-type":"print"},{"key":"10.1016\/j.ejc.2026.104388_b7","article-title":"Synchronizing times for k-sets in automata","volume":"29","author":"Behague","year":"2022","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.ejc.2026.104388_b8","article-title":"A course in universal algebra","volume":"vol. 78","author":"Burris","year":"1981"},{"issue":"3","key":"10.1016\/j.ejc.2026.104388_b9","first-page":"208","article-title":"Pozn\u00e1mka k homog\u00e9nnym experimentom s kone\u010dn\u00fdmi automatmi","volume":"14","author":"\u010cern\u00fd","year":"1964","journal-title":"Matematicko-Fyzik\u00e1lny Cas."},{"key":"10.1016\/j.ejc.2026.104388_b10","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0304-3975(85)90042-8","article-title":"Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra","volume":"36","author":"Demel","year":"1985","journal-title":"Theoret. Comput. Sci.","ISSN":"https:\/\/id.crossref.org\/issn\/0304-3975","issn-type":"print"},{"key":"10.1016\/j.ejc.2026.104388_b11","first-page":"3","article-title":"The \u010cern\u00fd conjecture and 1-contracting automata","volume":"23","author":"Don","year":"2015","journal-title":"Electron. J. Comb."},{"issue":"1\u20133","key":"10.1016\/j.ejc.2026.104388_b12","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1051\/ita\/1998321-300211","article-title":"Sur les automates circulaires et la conjecture de \u010cern\u00fd","volume":"32","author":"Dubuc","year":"1998","journal-title":"RAIRO-Theor. Inf. Appl."},{"issue":"3","key":"10.1016\/j.ejc.2026.104388_b13","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."},{"issue":"1","key":"10.1016\/j.ejc.2026.104388_b14","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1111\/j.1749-6632.1993.tb52513.x","article-title":"A primer on galois connections","volume":"704","author":"Ern\u00e9","year":"1993","journal-title":"Ann. New York Acad. Sci."},{"issue":"2","key":"10.1016\/j.ejc.2026.104388_b15","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0195-6698(82)80025-5","article-title":"An extremal problem for two families of sets","volume":"3","author":"Frankl","year":"1982","journal-title":"European J. Combin.","ISSN":"https:\/\/id.crossref.org\/issn\/0195-6698","issn-type":"print"},{"issue":"3\u20134","key":"10.1016\/j.ejc.2026.104388_b16","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s00012-008-2073-1","article-title":"Computing congruences efficiently","volume":"59","author":"Freese","year":"2008","journal-title":"Algebra Univers.","ISSN":"https:\/\/id.crossref.org\/issn\/0002-5240","issn-type":"print"},{"key":"10.1016\/j.ejc.2026.104388_b17","series-title":"Introduction to Automata Theory, Languages, and Computation","isbn-type":"print","author":"Hopcroft","year":"2001","ISBN":"https:\/\/id.crossref.org\/isbn\/0201441241"},{"key":"10.1016\/j.ejc.2026.104388_b18","series-title":"Fundamentals of Semigroup Theory","isbn-type":"print","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198511946.001.0001","author":"Howie","year":"1995","ISBN":"https:\/\/id.crossref.org\/isbn\/9780198511946"},{"issue":"1","key":"10.1016\/j.ejc.2026.104388_b19","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0304-3975(02)00405-X","article-title":"Synchronizing finite automata on Eulerian digraphs","volume":"295","author":"Kari","year":"2003","journal-title":"Theoret. Comput. Sci.","ISSN":"https:\/\/id.crossref.org\/issn\/0304-3975","issn-type":"print"},{"key":"10.1016\/j.ejc.2026.104388_b20","series-title":"Handbook of Automata Theory. Volume I. Theoretical Foundations","doi-asserted-by":"crossref","first-page":"525","DOI":"10.4171\/automata-1\/15","article-title":"\u010cern\u00fd\u2019s conjecture and the road colouring problem","author":"Kari","year":"2021"},{"key":"10.1016\/j.ejc.2026.104388_b21","isbn-type":"print","article-title":"A first course in noncommutative rings","volume":"vol. 131","author":"Lam","year":"1991","ISBN":"https:\/\/id.crossref.org\/isbn\/0387975233"},{"key":"10.1016\/j.ejc.2026.104388_b22","series-title":"Combinatorial Mathematics","first-page":"535","article-title":"On two combinatorial problems arising from automata theory","volume":"vol. 75","author":"Pin","year":"1983"},{"key":"10.1016\/j.ejc.2026.104388_b23","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/j.aam.2018.04.006","article-title":"Strongly connected synchronizing automata and the language of minimal reset words","volume":"99","author":"Rodaro","year":"2018","journal-title":"Adv. Appl. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0196-8858","issn-type":"print"},{"issue":"3","key":"10.1016\/j.ejc.2026.104388_b24","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s10801-018-0851-1","article-title":"A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number","volume":"50","author":"Rodaro","year":"2019","journal-title":"J. Algebraic Combin.","ISSN":"https:\/\/id.crossref.org\/issn\/0925-9899","issn-type":"print"},{"issue":"4","key":"10.1016\/j.ejc.2026.104388_b25","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1007\/s10559-015-9742-9","article-title":"Primitive and irreducible automata","volume":"51","author":"Rystsov","year":"2015","journal-title":"Cybern. Syst. Anal.","ISSN":"https:\/\/id.crossref.org\/issn\/1060-0396","issn-type":"print"},{"issue":"2\u20134","key":"10.1016\/j.ejc.2026.104388_b26","first-page":"367","article-title":"An improvement to a recent upper bound for synchronizing words of finite automata","volume":"24","author":"Shitov","year":"2019","journal-title":"J. Autom. Lang. Comb.","ISSN":"https:\/\/id.crossref.org\/issn\/1430-189X","issn-type":"print"},{"issue":"1","key":"10.1016\/j.ejc.2026.104388_b27","doi-asserted-by":"crossref","DOI":"10.37236\/436","article-title":"A theory of transformation monoids: combinatorics and representation theory","volume":"17","author":"Steinberg","year":"2010","journal-title":"Electron. J. Comb.","ISSN":"https:\/\/id.crossref.org\/issn\/1077-8926","issn-type":"print"},{"issue":"39","key":"10.1016\/j.ejc.2026.104388_b28","doi-asserted-by":"crossref","first-page":"5487","DOI":"10.1016\/j.tcs.2011.06.012","article-title":"The \u010cern\u00fd conjecture for one-cluster automata with prime length cycle","volume":"412","author":"Steinberg","year":"2011","journal-title":"Theoret. Comput. Sci.","ISSN":"https:\/\/id.crossref.org\/issn\/0304-3975","issn-type":"print"},{"key":"10.1016\/j.ejc.2026.104388_b29","series-title":"35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, Caen, France, February 28 \u2013 March 3, 2018","isbn-type":"print","first-page":"13","article-title":"Improving the upper bound on the length of the shortest reset word","author":"Szyku\u0142a","year":"2018","ISBN":"https:\/\/id.crossref.org\/isbn\/9783959770620"},{"issue":"2","key":"10.1016\/j.ejc.2026.104388_b30","first-page":"3","article-title":"The \u010cern\u00fd conjecture for aperiodic automata","volume":"9","author":"Trahtman","year":"2007","journal-title":"Discrete Math. Theor. Comput. Sci.","ISSN":"https:\/\/id.crossref.org\/issn\/1365-8050","issn-type":"print"},{"key":"10.1016\/j.ejc.2026.104388_b31","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s11856-009-0062-5","article-title":"The road coloring problem","volume":"172","author":"Trahtman","year":"2009","journal-title":"Israel J. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/1565-8511","issn-type":"print"},{"key":"10.1016\/j.ejc.2026.104388_b32","series-title":"Implementation and Application of Automata. 12th International Conference, CIAA 2007, Prague, Czech Republic, July 16\u201318, 2007. Revised Selected Papers","isbn-type":"print","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/978-3-540-76336-9_5","article-title":"Synchronizing automata preserving a chain of partial orders","author":"Volkov","year":"2007","ISBN":"https:\/\/id.crossref.org\/isbn\/9783540763352"},{"key":"10.1016\/j.ejc.2026.104388_b33","series-title":"Language and Automata Theory and Applications. Second International Conference, LATA 2008, Tarragona, Spain, March 13\u201319, 2008. Revised Papers","isbn-type":"print","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/978-3-540-88282-4_4","article-title":"Synchronizing automata and the \u010cern\u00fd conjecture","author":"Volkov","year":"2008","ISBN":"https:\/\/id.crossref.org\/isbn\/9783540882817"},{"issue":"5","key":"10.1016\/j.ejc.2026.104388_b34","doi-asserted-by":"crossref","first-page":"819","DOI":"10.4213\/rm10005e","article-title":"Synchronization of finite automata","volume":"77","author":"Volkov","year":"2022","journal-title":"Russ. Math. Surv.","ISSN":"https:\/\/id.crossref.org\/issn\/0036-0279","issn-type":"print"},{"key":"10.1016\/j.ejc.2026.104388_b35","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1051\/ita\/2024003","article-title":"Synchronization of primitive automata","volume":"58","author":"Volkov","year":"2024","journal-title":"RAIRO Theor. Inf. Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0988-3754","issn-type":"print"},{"key":"10.1016\/j.ejc.2026.104388_b36","series-title":"List of results on the \u010cern\u00fd conjecture and reset thresholds for synchronizing automata","author":"Volkov","year":"2025"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000569?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000569?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T01:47:34Z","timestamp":1780105654000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669826000569"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":36,"alternative-id":["S0195669826000569"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104388","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The hereditariness problem for the \u010cern\u00fd conjecture","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104388","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"104388"}}