{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T08:27:39Z","timestamp":1762504059137,"version":"build-2065373602"},"reference-count":37,"publisher":"World Scientific Pub Co Pte Ltd","issue":"07","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2025,11]]},"abstract":"<jats:p>A class of languages is closed under a given operation if the resulting language belongs to this class whenever the operands belong to it. We examine the closure properties of various subclasses of regular languages under basic operations of intersection, union, concatenation and power, positive closure and star, reversal, and complementation. We consider the following classes: definite languages and their variants (left ideal, finitely generated left ideal, symmetric definite, generalized definite and combinational), two-sided comets and their variants comets and stars, and the classes of singleton, finite, ordered, star-free, and power-separating languages. We also give an overview about subclasses of convex languages (classes of ideal, free, and closed languages), union-free languages, and group languages. We summarize some inclusion relations between these classes. Subsequently, for all pairs of a class and an operation, we provide an answer whether this class is closed under this operation or not.<\/jats:p>","DOI":"10.1142\/s0129054123450016","type":"journal-article","created":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T09:26:31Z","timestamp":1683192391000},"page":"1063-1087","source":"Crossref","is-referenced-by-count":2,"title":["Closure Properties of Subregular Languages Under Operations"],"prefix":"10.1142","volume":"36","author":[{"given":"Viktor","family":"Olej\u00e1r","sequence":"first","affiliation":[{"name":"Mathematical Institute, Slovak Academy of Sciences, Gre\u0161\u00e1kov\u00e1 6, 040 01 Ko\u0161ice, Slovakia"},{"name":"Institute of Computer Science, Faculty of Science, P. J. \u0160af\u00e1rik University, Jesenn\u00e1 5, 040 01 Ko\u0161ice, Slovakia"}]},{"given":"Alexander","family":"Szabari","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, Faculty of Science, P. J. \u0160af\u00e1rik University, Jesenn\u00e1 5, 040 01 Ko\u0161ice, Slovakia"}]}],"member":"219","published-online":{"date-parts":[[2023,5,4]]},"reference":[{"issue":"2","key":"S0129054123450016BIB001","first-page":"445","volume":"19","author":"Ang T.","year":"2009","journal-title":"Acta Cybern."},{"key":"S0129054123450016BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.05.019"},{"key":"S0129054123450016BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(73)80005-6"},{"key":"S0129054123450016BIB004","doi-asserted-by":"publisher","DOI":"10.14232\/actacyb.21.4.2014.1"},{"key":"S0129054123450016BIB005","first-page":"529","volume-title":"Proc. Symp. on Mathematical Theory of Automata, MRI Symposia Series","volume":"12","author":"Brzozowski J. A.","year":"1962"},{"key":"S0129054123450016BIB006","doi-asserted-by":"publisher","DOI":"10.1145\/321406.321409"},{"key":"S0129054123450016BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.10.055"},{"key":"S0129054123450016BIB008","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-013-9515-7"},{"key":"S0129054123450016BIB009","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2889"},{"key":"S0129054123450016BIB010","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-23247-4_7"},{"key":"S0129054123450016BIB011","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1966.264264"},{"key":"S0129054123450016BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.12.054"},{"key":"S0129054123450016BIB013","first-page":"99","volume-title":"Automata, Formal Languages, and Related Topics\u2013Dedicated to Ferenc G\u00e9cseg on the occasion of his 70th birthday","author":"Han Y.","year":"2009"},{"key":"S0129054123450016BIB014","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-13435-8_14"},{"key":"S0129054123450016BIB015","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054118400063"},{"key":"S0129054123450016BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.04.028"},{"key":"S0129054123450016BIB017","first-page":"109","volume-title":"NCMA 2015, books@ocg.at","volume":"318","author":"Holzer M.","year":"2015"},{"volume-title":"Introduction to Automata Theory, Languages and Computation","year":"1979","author":"Hopcroft J. E.","key":"S0129054123450016BIB018"},{"key":"S0129054123450016BIB019","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.02.002"},{"key":"S0129054123450016BIB020","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054120420083"},{"key":"S0129054123450016BIB021","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.12.027"},{"key":"S0129054123450016BIB022","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-48516-0_10"},{"key":"S0129054123450016BIB023","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054111008933"},{"volume-title":"Counter-Free Automata (M.I.T. Research Monograph No. 65)","year":"1971","author":"McNaughton R.","key":"S0129054123450016BIB024"},{"key":"S0129054123450016BIB025","doi-asserted-by":"publisher","DOI":"10.1145\/321510.321513"},{"key":"S0129054123450016BIB026","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-23247-4_3"},{"key":"S0129054123450016BIB027","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-13502-6_9"},{"key":"S0129054123450016BIB028","doi-asserted-by":"publisher","DOI":"10.1145\/321281.321292"},{"key":"S0129054123450016BIB029","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1963.263534"},{"volume-title":"The Dot-Depth Hierarchy, 45 Years Later (The Role of Theory in Computer Science: Essays Dedicated to Janusz Brzozowski)","year":"2017","author":"Pin J.","key":"S0129054123450016BIB031"},{"key":"S0129054123450016BIB032","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(65)90108-7"},{"key":"S0129054123450016BIB033","first-page":"9","volume":"5","author":"Shyr H.","year":"1974","journal-title":"Tamkang J. Math."},{"key":"S0129054123450016BIB034","doi-asserted-by":"publisher","DOI":"10.1007\/BF01761710"},{"key":"S0129054123450016BIB035","doi-asserted-by":"publisher","DOI":"10.1007\/BF01691347"},{"key":"S0129054123450016BIB036","unstructured":"G. Thierrin,  Convex languages, ICALP 1972,  (North-Holland,  Amsterdam,  1972), pp. 481\u2013492."},{"volume-title":"Hierarchy of Subregular Language Families","year":"2018","author":"Truthe B.","key":"S0129054123450016BIB037"},{"key":"S0129054123450016BIB038","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-13502-6_2"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054123450016","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T08:17:08Z","timestamp":1762503428000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129054123450016"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,4]]},"references-count":37,"journal-issue":{"issue":"07","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["10.1142\/S0129054123450016"],"URL":"https:\/\/doi.org\/10.1142\/s0129054123450016","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2023,5,4]]}}}