{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T11:11:22Z","timestamp":1779448282739,"version":"3.53.1"},"reference-count":21,"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,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"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.115889","type":"journal-article","created":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T03:07:13Z","timestamp":1773457633000},"page":"115889","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["State complexity of side and rim operations"],"prefix":"10.1016","volume":"1072","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9777-3012","authenticated-orcid":false,"given":"Cezar","family":"C\u00e2mpeanu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115889_bib0001","first-page":"129","article-title":"Gedanken-experiments on sequential machines","volume":"34","author":"Moore","year":"1956","journal-title":"Automata Stud., Annal. Math. Stud."},{"key":"10.1016\/j.tcs.2026.115889_bib0002","series-title":"Sixth Workshop on Non-Classical Models for Automata and Applications - NCMA 2014, Kassel, Germany, July 28\u201329, 2014. Proceedings","first-page":"85","article-title":"The distinguishability operation on regular languages","volume":"304","author":"C\u00e2mpeanu","year":"2014"},{"issue":"3-4","key":"10.1016\/j.tcs.2026.115889_bib0003","doi-asserted-by":"crossref","first-page":"243","DOI":"10.3233\/FI-2016-1434","article-title":"Distinguishability operations and closures","volume":"148","author":"C\u00e2mpeanu","year":"2016","journal-title":"Fundam. Inform."},{"key":"10.1016\/j.tcs.2026.115889_bib0004","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2024.114782","article-title":"Binary distinguishability operation","volume":"1016","author":"C\u00e2mpeanu","year":"2024","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115889_bib0005","doi-asserted-by":"crossref","first-page":"182","DOI":"10.4064\/fm-3-1-182-199","article-title":"Sur l\u2019operation A\u203e de l\u2019analysis situs","volume":"3","author":"Kuratowski","year":"1922","journal-title":"Fundament. Math."},{"key":"10.1016\/j.tcs.2026.115889_bib0006","first-page":"9","article-title":"The Kuratowski closure and complement theorem","volume":"38","author":"Gardner","year":"2008","journal-title":"N. Zeal. J. Math."},{"key":"10.1016\/j.tcs.2026.115889_bib0007","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0012-365X(84)90055-4","article-title":"A generalized closure and complement phenomenon","volume":"50","author":"Peleg","year":"1984","journal-title":"Discret. Math."},{"key":"10.1016\/j.tcs.2026.115889_bib0008","first-page":"11","article-title":"A note on some generalized closure and interior operators in a topological space","volume":"6","author":"Gupta","year":"2017","journal-title":"Math. Applic."},{"issue":"9","key":"10.1016\/j.tcs.2026.115889_bib0009","article-title":"The group-theoretic analog of Kuratowski\u2019s closure-complement theorem","volume":"125","author":"Santiago","year":"2018","journal-title":"Am. Math. Month."},{"issue":"6","key":"10.1016\/j.tcs.2026.115889_bib0010","doi-asserted-by":"crossref","first-page":"1218","DOI":"10.1016\/j.disc.2011.11.033","article-title":"Complements and consistent closures","volume":"312","author":"Cato","year":"2012","journal-title":"Discret. Math."},{"issue":"02","key":"10.1016\/j.tcs.2026.115889_bib0011","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1142\/S0129054111008052","article-title":"Closures in formal languages and Kuratowski\u2019s theorem","volume":"22","author":"Brzozowski","year":"2011","journal-title":"Int. J. Foundat. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2026.115889_bib0012","article-title":"Generalization of Kuratowski problem in vector spaces","volume":"121","author":"Shafie","year":"2019","journal-title":"Am. Math. Month."},{"key":"10.1016\/j.tcs.2026.115889_bib0013","doi-asserted-by":"crossref","first-page":"3","DOI":"10.4064\/fm-9-1-3-15","article-title":"Quelques notions fondamentales de l\u2019analysis situs au point de vue de l\u2019Alg\u2019ebre de la logique","volume":"9","author":"Zarycki","year":"1927","journal-title":"Fundament. Math."},{"issue":"6","key":"10.1016\/j.tcs.2026.115889_bib0014","first-page":"806","article-title":"On the frontier operator in boolean algebras with a closure","volume":"26","author":"Gaida","year":"1974","journal-title":"Ukrainskii Matematicheskii Zhurnal"},{"key":"10.1016\/j.tcs.2026.115889_bib0015","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/j.tcs.2026.115889_bib0016","first-page":"7","article-title":"Regular languages and programming languages","volume":"23","author":"C\u00e2mpeanu","year":"1986","journal-title":"Revue Roumaine de Linguistique - CLTA"},{"key":"10.1016\/j.tcs.2026.115889_bib0017","series-title":"Languages of Cooperation and Communication: Essays Dedicated to Erzs\u00e9bet Csuhaj-Varj\u00fa to Celebrate Her Scientific Career","first-page":"26","article-title":"Binary right-distinguishability operation","author":"C\u00e2mpeanu","year":"2025"},{"key":"10.1016\/j.tcs.2026.115889_bib0018","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"2007"},{"issue":"2","key":"10.1016\/j.tcs.2026.115889_bib0019","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s00224-013-9515-7","article-title":"Quotient complexity of closed languages","volume":"54","author":"Brzozowski","year":"2014","journal-title":"Theory Comput. Syst."},{"issue":"6","key":"10.1016\/j.tcs.2026.115889_bib0020","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1142\/S0129054113400133","article-title":"In search of most complex regular languages","volume":"24","author":"Brzozowski","year":"2013","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115889_bib0021","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s00224-013-9515-7","article-title":"Quotient complexity of closed languages","volume":"54","author":"Brzozowski","year":"2014","journal-title":"Theory Comput. Syst."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001489?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001489?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T11:03:15Z","timestamp":1779447795000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526001489"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":21,"alternative-id":["S0304397526001489"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115889","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":"State complexity of side and rim operations","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115889","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115889"}}