{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T18:01:55Z","timestamp":1780682515740,"version":"3.54.1"},"reference-count":33,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100005357","name":"Slovak Research and Development Agency","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,8]]},"DOI":"10.1016\/j.tcs.2026.116049","type":"journal-article","created":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T05:48:38Z","timestamp":1779428918000},"page":"116049","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Language membership problems for subregular classes"],"prefix":"10.1016","volume":"1081","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1752-544X","authenticated-orcid":false,"given":"Michal","family":"Hospod\u00e1r","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4308-9159","authenticated-orcid":false,"given":"Viktor","family":"Olej\u00e1r","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-6501-1096","authenticated-orcid":false,"given":"Juraj","family":"\u0160ebej","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.116049_sbref0001","series-title":"Proc. CIAA 2024","first-page":"180","article-title":"Decision problems for subregular classes","volume":"Vol. 15015","author":"Hospod\u00e1r","year":"2024"},{"issue":"6","key":"10.1016\/j.tcs.2026.116049_bib0002","first-page":"520","article-title":"The theory of regular events. II","volume":"5","author":"Havel","year":"1969","journal-title":"Kybernetika"},{"issue":"1","key":"10.1016\/j.tcs.2026.116049_sbref0003","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/0207007","article-title":"Computational parallels between the regular and context-free languages","volume":"7","author":"Hunt","year":"1978","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.tcs.2026.116049_sbref0004","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0304-3975(91)90075-D","article-title":"Finite-automaton aperiodicity is PSPACE-complete","volume":"88","author":"Cho","year":"1991","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"10.1016\/j.tcs.2026.116049_sbref0005","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/j.ic.2010.11.009","article-title":"Decision problems for convex languages","volume":"209","author":"Brzozowski","year":"2011","journal-title":"Inf. Comput."},{"key":"10.1016\/j.tcs.2026.116049_sbref0006","series-title":"The Role of Theory in Computer Science - Essays Dedicated to Janusz Brzozowski","first-page":"59","article-title":"Structure and complexity of some subregular language families","author":"Holzer","year":"2017"},{"key":"10.1016\/j.tcs.2026.116049_sbref0007","series-title":"IFIG Research Report 1801","article-title":"Hierarchy of Subregular Language Families","author":"Truthe","year":"2018"},{"key":"10.1016\/j.tcs.2026.116049_sbref0008","series-title":"Proc. NCMA 2024","first-page":"118","article-title":"Various types of comet languages and their application in external contextual grammars","volume":"Vol. 407","author":"K\u00f6dding","year":"2024"},{"key":"10.1016\/j.tcs.2026.116049_sbref0009","series-title":"Proc. FoCS 1977","first-page":"254","article-title":"Lower bounds for natural proof systems","author":"Kozen","year":"1977"},{"key":"10.1016\/j.tcs.2026.116049_bib0010","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/j.tcs.2026.116049_bib0011","series-title":"Introduction to the Theory of Computation","author":"Sipser","year":"2012"},{"issue":"4","key":"10.1016\/j.tcs.2026.116049_sbref0012","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","article-title":"Linear automaton transformations","volume":"9","author":"Nerode","year":"1958","journal-title":"Proc. Amer. Math. Soc."},{"issue":"2","key":"10.1016\/j.tcs.2026.116049_sbref0013","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationships between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"10.1016\/j.tcs.2026.116049_sbref0014","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00299636","article-title":"The method of forced enumeration for nondeterministic automata","volume":"26","author":"Szelepcs\u00e9nyi","year":"1988","journal-title":"Acta Inform."},{"issue":"3","key":"10.1016\/j.tcs.2026.116049_sbref0015","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1016\/j.ic.2010.11.013","article-title":"Descriptional and computational complexity of finite automata - a survey","volume":"209","author":"Holzer","year":"2011","journal-title":"Inf. Comput."},{"key":"10.1016\/j.tcs.2026.116049_sbref0016","series-title":"Proc. FoCS 1978","first-page":"65","article-title":"One-way log-tape reductions","author":"Hartmanis","year":"1978"},{"issue":"1","key":"10.1016\/j.tcs.2026.116049_sbref0017","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/S0022-0000(75)80014-6","article-title":"On tape-bounded complexity classes and multihead finite automata","volume":"10","author":"Sudborough","year":"1975","journal-title":"J. Comput. Syst. Sci."},{"issue":"7","key":"10.1016\/j.tcs.2026.116049_sbref0018","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1142\/S0129054123450016","article-title":"Closure properties of subregular languages under operations","volume":"36","author":"Olej\u00e1r","year":"2025","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116049_sbref0019","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.tcs.2021.09.007","article-title":"Automata for solid codes","volume":"892","author":"J\u00fcrgensen","year":"2021","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"10.1016\/j.tcs.2026.116049_sbref0020","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1145\/321406.321409","article-title":"Roots of star events","volume":"14","author":"Brzozowski","year":"1967","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/j.tcs.2026.116049_sbref0021","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01691347","article-title":"Permutation automata","volume":"2","author":"Thierrin","year":"1968","journal-title":"Math. Syst. Theory"},{"key":"10.1016\/j.tcs.2026.116049_bib0022","first-page":"9","article-title":"Ordered automata and associated languages","volume":"5","author":"Shyr","year":"1974","journal-title":"Tamkang J. Math."},{"issue":"2","key":"10.1016\/j.tcs.2026.116049_sbref0023","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","article-title":"On finite monoids having only trivial subgroups","volume":"8","author":"Sch\u00fctzenberger","year":"1965","journal-title":"Inf. Contr."},{"issue":"1","key":"10.1016\/j.tcs.2026.116049_sbref0024","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/BF01761710","article-title":"Power-separating regular languages","volume":"8","author":"Shyr","year":"1974","journal-title":"Math. Syst. Theory"},{"key":"10.1016\/j.tcs.2026.116049_sbref0025","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.tcs.2012.10.055","article-title":"Quotient complexity of ideal languages","volume":"470","author":"Brzozowski","year":"2013","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"10.1016\/j.tcs.2026.116049_sbref0026","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0019-9958(85)80058-9","article-title":"Complexity of some problems from the theory of automata","volume":"66","author":"Stern","year":"1985","journal-title":"Inf. Contr."},{"key":"10.1016\/j.tcs.2026.116049_sbref0027","series-title":"Proc. DLT 2020","first-page":"122","article-title":"Operations on permutation automata","volume":"Vol. 12086","author":"Hospod\u00e1r","year":"2020"},{"key":"10.1016\/j.tcs.2026.116049_sbref0028","series-title":"Proc. SWAT 1971","first-page":"166","article-title":"Characterizations of locally testable events","author":"Brzozowski","year":"1971"},{"issue":"35","key":"10.1016\/j.tcs.2026.116049_sbref0029","doi-asserted-by":"crossref","first-page":"3209","DOI":"10.1016\/j.tcs.2009.05.019","article-title":"Determination of finite automata accepting subregular languages","volume":"410","author":"Bordihn","year":"2009","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116049_bib0030","article-title":"On the structure and syntactic complexity of generalized definite languages","volume":"abs\/1304.5714","author":"Iv\u00e1n","year":"2013","journal-title":"CoRR"},{"issue":"2","key":"10.1016\/j.tcs.2026.116049_sbref0031","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":"1","key":"10.1016\/j.tcs.2026.116049_sbref0032","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1137\/0208008","article-title":"Total ordering problem","volume":"8","author":"Opatrny","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2026.116049_bib0033","article-title":"Alternating towers and piecewise testable separators","volume":"abs\/1409.3943","author":"Holub","year":"2014","journal-title":"CoRR"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002999?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002999?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T17:18:59Z","timestamp":1780679939000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526002999"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":33,"alternative-id":["S0304397526002999"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116049","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Language membership problems for subregular classes","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116049","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":"116049"}}