{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,28]],"date-time":"2026-06-28T08:45:18Z","timestamp":1782636318727,"version":"3.54.5"},"reference-count":32,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.446.4","type":"journal-article","created":{"date-parts":[[2026,6,28]],"date-time":"2026-06-28T08:24:52Z","timestamp":1782635092000},"page":"53-71","source":"Crossref","is-referenced-by-count":0,"title":["Idefix-Free Languages and Their Application in External Contextual Grammars"],"prefix":"10.4204","volume":"446","author":[{"given":"Marvin","family":"K\u00f6dding","sequence":"first","affiliation":[{"name":"PH Heidelberg"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bianca","family":"Truthe","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Giessen"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2720","published-online":{"date-parts":[[2026,6,25]]},"reference":[{"issue":"35","key":"Bordihn_Holzer_Kutrib.2009","doi-asserted-by":"publisher","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":"Theoretical Computer Science"},{"key":"Brzozowski.1962","volume-title":"Regular expression techniques for sequential circuits","author":"Brzozowski","year":"1962"},{"issue":"3","key":"Brzozowski.1967","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1109\/SWAT.1966.21","article-title":"Roots of star events","volume":"14","author":"Brzozowski","year":"1967","journal-title":"Journal of the ACM"},{"issue":"1","key":"Brzozowski_Cohen.1969","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1145\/321495.321505","article-title":"On decompositions of regular events","volume":"16","author":"Brzozowski","year":"1969","journal-title":"Journal of the ACM"},{"key":"Brzozowski_Jiraskova_Zou.2014","doi-asserted-by":"publisher","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 of Computing Systems"},{"key":"Dassow.2005","first-page":"109","article-title":"Contextual grammars with subregular choice","volume":"64","author":"Dassow","year":"2005","journal-title":"Fundamenta Informaticae"},{"key":"Dassow.2015","first-page":"25","article-title":"Contextual languages with strictly locally testable and star free selection languages","volume":"62","author":"Dassow","year":"2015","journal-title":"Analele Universitatii Bucuresti"},{"key":"Dassow_Manea_Truthe.2012","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.tcs.2012.04.008","article-title":"On external contextual grammars with subregular selection languages","volume":"449","author":"Dassow","year":"2012","journal-title":"Theoretical Computer Science"},{"key":"DasManTru12b","doi-asserted-by":"publisher","first-page":"145","DOI":"10.25596\/jalc-2012-145","article-title":"On Subregular Selection Languages in Internal Contextual Grammars","volume":"17","author":"Dassow","year":"2012","journal-title":"Journal of Automata, Languages, and Combinatorics"},{"key":"Dassow_Truthe.2023","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/2023012","article-title":"Relations of contextual grammars with strictly locally testable selection languages","volume":"57","author":"Dassow","year":"2023","journal-title":"RAIRO \u2013 Theoretical Informatics and Applications"},{"key":"Gecseg_Peak.1972","volume-title":"Algebraic Theory of Automata","author":"G\u00e9cseg","year":"1972"},{"issue":"1","key":"Gill_Kou.1974","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0022-0000(74)80034-6","article-title":"Multiple-entry finite automata","volume":"9","author":"Gill","year":"1974","journal-title":"Journal of Computer and System Sciences"},{"issue":"6","key":"Havel.1969","first-page":"520","article-title":"The theory of regular events II","volume":"5","author":"Havel","year":"1969","journal-title":"Kybernetika"},{"key":"Holzer_Truthe.2015","series-title":"books@ocg.at","first-page":"109","article-title":"On relations between some subregular language families","volume-title":"Seventh Workshop on Non-Classical Models of Automata and Applications \u2013 NCMA 2015, Porto, Portugal, August 31 \u2013 September 1, 2015. Proceedings","volume":"318","author":"Holzer","year":"2015"},{"key":"Istrail.1978","first-page":"287","article-title":"Gramatici contextuale cu selectiva regulata","volume":"30","author":"Istrail","year":"1978","journal-title":"Stud. Cerc. Mat"},{"key":"Koedding.Truthe.2024","series-title":"EPTCS","doi-asserted-by":"publisher","first-page":"118","DOI":"10.4204\/EPTCS.407.9","article-title":"Various Types of Comet Languages and their Application in External Contextual Grammars","volume-title":"Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024), NCMA 2024, G\u00f6ttingen, Germany, 12\u201313 August 2024","volume":"407","author":"K\u00f6dding","year":"2024"},{"key":"Koedding.Truthe.2025.idefix","article-title":"Idefix-Closed Languages and Their Application in Contextual Grammars","author":"K\u00f6dding","year":"submitted","journal-title":"RAIRO \u2013 Theoretical Informatics and Applications"},{"key":"Koedding.Truthe.NCMA24.JALC.2025","article-title":"Various Types of Comet Languages and Their Application in Contextual Grammars","author":"K\u00f6dding","year":"submitted","journal-title":"Journal of Automata, Languages, and Combinatorics"},{"key":"Kudlek.2004","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-540-24635-0_20","article-title":"On languages of cyclic words","volume-title":"Aspects of Molecular Computing, Essays Dedicated to Tom Head on the Occasion of His 70th Birthday","volume":"2950","author":"Kudlek","year":"2004"},{"key":"Marcus.1969","first-page":"1525","article-title":"Contextual grammars","volume":"14","author":"Marcus","year":"1969","journal-title":"Revue Roumaine de Math\u00e9matique Pures et Appliqu\u00e9es"},{"key":"McNaughton_Papert.1971","volume-title":"Counter-Free Automata","author":"McNaughton","year":"1971"},{"key":"Nagy.2019","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-030-23247-4_3","article-title":"Union-freeness, deterministic union-freeness and union-complexity","volume-title":"Descriptional Complexity of Formal Systems, 21st IFIP WG 1.02 International Conference, DCFS 2019, Ko\u0161ice, Slovakia, July 17\u201319, 2019, Proceedings","author":"Nagy","year":"2019"},{"issue":"7","key":"Olejar_Szabari.2023","doi-asserted-by":"publisher","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."},{"issue":"3","key":"Paz_Peleg.1965","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1145\/321281.321292","article-title":"Ultimate-definite and symmetric-definite events and automata","volume":"12","author":"Paz","year":"1965","journal-title":"Journal of the ACM"},{"key":"Perles_Rabin_Shamir.1963","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1109\/PGEC.1963.263534","article-title":"The theory of definite automata","volume":"12","author":"Perles","year":"1963","journal-title":"IEEE Transactions of Electronic Computers"},{"key":"Rozenberg_Salomaa.1997","doi-asserted-by":"publisher","volume-title":"Handbook of Formal Languages","year":"1997","DOI":"10.1007\/978-3-642-59136-5"},{"key":"Shyr.1991","volume-title":"Free Monoids and Languages","author":"Shyr","year":"1991"},{"issue":"1","key":"Shyr_Thierrin.1974.ord","first-page":"9","article-title":"Ordered automata and associated languages","volume":"5","author":"Shyr","year":"1974","journal-title":"Tamkang Journal of Mathematics"},{"issue":"1","key":"Shyr_Thierrin.1974.ps","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/BF01761710","article-title":"Power-separating regular languages","volume":"8","author":"Shyr","year":"1974","journal-title":"Mathematical Systems Theory"},{"key":"Truthe.2014","series-title":"books@ocg.at","first-page":"235","article-title":"A relation between definite and ordered finite automata","volume-title":"Sixth Workshop on Non-Classical Models for Automata and Applications \u2013 NCMA 2014, Kassel, Germany, July 28\u201329, 2014. Proceedings","volume":"304","author":"Truthe","year":"2014"},{"key":"Truthe.2021","doi-asserted-by":"publisher","first-page":"123","DOI":"10.3233\/FI-2021-2037","article-title":"Generative capacity of contextual grammars with subregular selection languages","volume":"180","author":"Truthe","year":"2021","journal-title":"Fundamenta Informaticae"},{"key":"Wiedemann.1978","volume-title":"Vergleich der Leistungsf\u00e4higkeit endlicher determinierter Automaten","author":"Wiedemann","year":"1978"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,6,28]],"date-time":"2026-06-28T08:24:59Z","timestamp":1782635099000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/2606.26682v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,25]]},"references-count":32,"URL":"https:\/\/doi.org\/10.4204\/eptcs.446.4","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,25]]}}}