{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T15:04:32Z","timestamp":1779980672689,"version":"3.53.1"},"reference-count":21,"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,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100005357","name":"APVV","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005357","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006109","name":"Scientific Grant Agency of the M\u0160VVa\u0160 and the SAV","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006109","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,7]]},"DOI":"10.1016\/j.tcs.2026.116027","type":"journal-article","created":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T14:44:18Z","timestamp":1779029058000},"page":"116027","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The boundary operation on some subclasses of convex regular languages"],"prefix":"10.1016","volume":"1079","author":[{"given":"Jozef","family":"Jir\u00e1sek","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9817-8197","authenticated-orcid":false,"given":"Galina","family":"Jir\u00e1skov\u00e1","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.116027_bib0001","series-title":"Developments in Language Theory, DLT 2015","first-page":"300","article-title":"The boundary of prefix-free languages","volume":"9168","author":"Jir\u00e1sek","year":"2015"},{"issue":"2","key":"10.1016\/j.tcs.2026.116027_bib0002","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. Found. Comput. Sci."},{"issue":"2\u20133","key":"10.1016\/j.tcs.2026.116027_bib0003","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.tcs.2007.04.015","article-title":"State complexity of combined operations","volume":"383","author":"Salomaa","year":"2007","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116027_bib0004","unstructured":"J. Shallit, Open problems in automata theory and formal languages, https:\/\/cs.uwaterloo.ca\/~shallit\/Talks\/open10r.pdf."},{"key":"10.1016\/j.tcs.2026.116027_bib0005","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.tcs.2015.01.022","article-title":"On the boundary of regular languages","volume":"578","author":"Jir\u00e1sek","year":"2015","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116027_bib0006","first-page":"1373","article-title":"Estimates of the number of states of finite automata","volume":"11","author":"Maslov","year":"1970","journal-title":"Sov. Math. Dokl."},{"issue":"2","key":"10.1016\/j.tcs.2026.116027_bib0007","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0304-3975(92)00011-F","article-title":"The state complexities of some basic operations on regular languages","volume":"125","author":"Yu","year":"1994","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2026.116027_bib0008","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1142\/S012905410200100X","article-title":"Unary language operations, state complexity and Jacobsthal\u2019s function","volume":"13","author":"Pighizzini","year":"2002","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116027_bib0009","series-title":"Automata Implementation, WIA\u201999","first-page":"60","article-title":"State complexity of basic operations on finite languages","volume":"2214","author":"C\u00e2mpeanu","year":"1999"},{"issue":"6","key":"10.1016\/j.tcs.2026.116027_bib0010","doi-asserted-by":"crossref","first-page":"1261","DOI":"10.1142\/S0129054112400515","article-title":"Quotient complexity of star-free languages","volume":"23","author":"Brzozowski","year":"2012","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"7","key":"10.1016\/j.tcs.2026.116027_bib0011","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1142\/S0129054111008933","article-title":"Complexity in union-free regular languages","volume":"22","author":"Jir\u00e1skov\u00e1","year":"2011","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116027_bib0012","series-title":"Descriptional Complexity of Formal Systems, DCFS 2013","first-page":"78","article-title":"State complexity of k-union and k-intersection for prefix-free regular languages","volume":"8031","author":"Eom","year":"2013"},{"key":"10.1016\/j.tcs.2026.116027_bib0013","series-title":"Discrete Mathematics and Computer Science. in Memoriam Alexandru Mateescu (1952\u20132005)","first-page":"137","article-title":"State complexity of combined operations for prefix-free regular languages","author":"Eom","year":"2014"},{"issue":"27\u201329","key":"10.1016\/j.tcs.2026.116027_bib0014","doi-asserted-by":"crossref","first-page":"2537","DOI":"10.1016\/j.tcs.2008.12.054","article-title":"State complexity of basic operations on suffix-free regular languages","volume":"410","author":"Han","year":"2009","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116027_bib0015","series-title":"Automata, Formal Languages, and Related Topics","first-page":"99","article-title":"Operational state complexity of prefix-free regular languages","author":"Han","year":"2009"},{"key":"10.1016\/j.tcs.2026.116027_bib0016","series-title":"Language and Automata Theory and Applications, LATA 2010","first-page":"1","article-title":"Complexity in convex languages","volume":"6031","author":"Brzozowski","year":"2010"},{"issue":"4","key":"10.1016\/j.tcs.2026.116027_bib0017","doi-asserted-by":"crossref","first-page":"507","DOI":"10.14232\/actacyb.21.4.2014.1","article-title":"Quotient complexity of bifix-, factor-, and subword-free regular languages","volume":"21","author":"Brzozowski","year":"2014","journal-title":"Acta Cybern."},{"key":"10.1016\/j.tcs.2026.116027_bib0018","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.tcs.2018.07.015","article-title":"Complexity of proper prefix-convex regular languages","volume":"787","author":"Brzozowski","year":"2019","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"10.1016\/j.tcs.2026.116027_bib0019","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1142\/S0129054115500392","article-title":"State complexity of boundary of prefix-free regular languages","volume":"26","author":"Eom","year":"2015","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116027_bib0020","series-title":"Mathematical and Engineering Methods in Computer Science, MEMICS 2011","first-page":"94","article-title":"Basic operations on binary suffix-free languages","volume":"7119","author":"Cmorik","year":"2011"},{"key":"10.1016\/j.tcs.2026.116027_bib0021","series-title":"Introduction to the Theory of Computation","author":"Sipser","year":"2012"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439752600277X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439752600277X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T14:24:10Z","timestamp":1779978250000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439752600277X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":21,"alternative-id":["S030439752600277X"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116027","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The boundary operation on some subclasses of convex regular languages","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116027","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":"116027"}}