{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T14:08:58Z","timestamp":1776175738425,"version":"3.50.1"},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T00:00:00Z","timestamp":1773446400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["R611368"],"award-info":[{"award-number":["R611368"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["PGS D-601066-2025"],"award-info":[{"award-number":["PGS D-601066-2025"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000086","name":"National Science Foundation Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["DMS-1937241"],"award-info":[{"award-number":["DMS-1937241"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.tcs.2026.115864","type":"journal-article","created":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T15:48:54Z","timestamp":1773589734000},"page":"115864","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A cornering strategy for synchronizing a DFA"],"prefix":"10.1016","volume":"1073","author":[{"given":"Peter","family":"Bradshaw","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Clow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ladislav","family":"Stacho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115864_bib0001","unstructured":"A. Ryzhikov, Synchronizing automata and coding theory. (Automates synchronisant et th\u00e9orie du codage), Ph.D. thesis, University of Paris-Est, France, 2020. https:\/\/tel.archives-ouvertes.fr\/tel-03157297."},{"issue":"3","key":"10.1016\/j.tcs.2026.115864_bib0002","first-page":"208","article-title":"Pozn\u00e1mka k homog\u00e9nnym experimentom s kone\u010dn\u1ef3mi automatmi","volume":"14","author":"\u010cern\u1ef3","year":"1964","journal-title":"Matematicko-fyzik\u00e1lny \u010dasopis"},{"key":"10.1016\/j.tcs.2026.115864_bib0003","article-title":"A general class of discrete codes and certai of their properties","author":"Laemmel","year":"1956","journal-title":"Res. Rep."},{"key":"10.1016\/j.tcs.2026.115864_bib0004","article-title":"Study on application of coding theory","author":"Laemmel","year":"1963","journal-title":"Polytechnic Inst. of Brooklyn."},{"key":"10.1016\/j.tcs.2026.115864_bib0005","series-title":"Some memory aspects of finite automata","author":"Liu","year":"1962"},{"issue":"4","key":"10.1016\/j.tcs.2026.115864_bib0006","first-page":"257","article-title":"Eine bemerkung \u00fcber homogene experimente","volume":"2","author":"Starke","year":"1966","journal-title":"J. Inf. Process. Cybern."},{"issue":"5","key":"10.1016\/j.tcs.2026.115864_bib0007","doi-asserted-by":"crossref","first-page":"53","DOI":"10.4213\/rm10005","article-title":"Synchronization of finite automata","volume":"77","author":"Volkov","year":"2022","journal-title":"Uspekhi Matematicheskikh Nauk"},{"key":"10.1016\/j.tcs.2026.115864_bib0008","series-title":"North-Holland Mathematics Studies","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/S0304-0208(08)73432-7","article-title":"On two combinatorial problems arising from automata theory","volume":"75","author":"Pin","year":"1983"},{"issue":"2","key":"10.1016\/j.tcs.2026.115864_bib0009","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":"Eur. J. Combinat."},{"issue":"2\u20134","key":"10.1016\/j.tcs.2026.115864_bib0010","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. Automata, Languages and Combinat."},{"key":"10.1016\/j.tcs.2026.115864_bib0011","series-title":"35Th Symposium on Theoretical Aspects of Computer Science","article-title":"Improving the upper bound on the length of the shortest reset words","author":"Szyku\u0142a","year":"2018"},{"key":"10.1016\/j.tcs.2026.115864_bib0012","series-title":"Fundamentals of Computation Theory: 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings 18","first-page":"173","article-title":"Modifying the upper bound on the length of minimal synchronizing word","author":"Trahtman","year":"2011"},{"issue":"1\u20133","key":"10.1016\/j.tcs.2026.115864_bib0013","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":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"10.1016\/j.tcs.2026.115864_bib0014","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1051\/ita\/1998321-300211","article-title":"Sur les automates circulaires et la conjecture de \u010dern\u1ef3","volume":"32","author":"Dubuc","year":"1998","journal-title":"RAIRO-Theoret. Inf. Appl."},{"issue":"3","key":"10.1016\/j.tcs.2026.115864_bib0015","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.tcs.2004.03.068","article-title":"Synchronizing monotonic automata","volume":"327","author":"Ananichev","year":"2004","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2026.115864_bib0016","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.tcs.2004.09.006","article-title":"Synchronizing generalized monotonic automata","volume":"330","author":"Ananichev","year":"2005","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"10.1016\/j.tcs.2026.115864_bib0017","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.tcs.2026.115864_bib0018","article-title":"The \u010cern\u00fd\u2019 conjecture for aperiodic automata","volume":"9","author":"Trahtman","year":"2007","journal-title":"Discrete Math. Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115864_bib0019","series-title":"Automata, computability and complexity : theory and applications","author":"Rich","year":"2008"},{"issue":"7","key":"10.1016\/j.tcs.2026.115864_bib0020","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1142\/S0129054115400067","article-title":"Large aperiodic semigroups","volume":"26","author":"Brzozowski","year":"2015","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115864_bib0021","article-title":"Convexity","volume":"187","author":"Simon","year":"2011"},{"key":"10.1016\/j.tcs.2026.115864_bib0022","article-title":"Convex polytopes","volume":"221","author":"Gr\u00fcnbaum","year":"2003"},{"issue":"1","key":"10.1016\/j.tcs.2026.115864_bib0023","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0095-8956(89)90066-X","article-title":"Radius, diameter, and minimum degree","volume":"47","author":"Erd\u0151s","year":"1989","journal-title":"J. Combinat. Theory, Series B"},{"issue":"2","key":"10.1016\/j.tcs.2026.115864_bib0024","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.aml.2011.08.010","article-title":"A note on diameter and the degree sequence of a graph","volume":"25","author":"Mukwembi","year":"2012","journal-title":"Appl. Math. Lett."},{"key":"10.1016\/j.tcs.2026.115864_bib0025","doi-asserted-by":"crossref","unstructured":"M. Blondin, M. Cadilhac, X. Cui, P. Czerner, J. Esparza, J. Schulz, Weakly acyclic diagrams: A data structure for infinite-state symbolic verification, International Conference on Tools and Algorithms for the Construction and Analysis of Systems(2025) 23\u201342.","DOI":"10.1007\/978-3-031-90660-2_2"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001234?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001234?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T13:29:19Z","timestamp":1776173359000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526001234"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":25,"alternative-id":["S0304397526001234"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115864","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A cornering strategy for synchronizing a DFA","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115864","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 B.V.","name":"copyright","label":"Copyright"}],"article-number":"115864"}}