{"id":227,"date":"2024-07-08T09:21:00","date_gmt":"2024-07-08T09:21:00","guid":{"rendered":"http:\/\/www.math.akita-u.ac.jp\/ciaa2024\/?page_id=227"},"modified":"2024-07-08T09:23:57","modified_gmt":"2024-07-08T09:23:57","slug":"accepted-papers","status":"publish","type":"page","link":"http:\/\/www.math.akita-u.ac.jp\/ciaa2024\/index.php\/accepted-papers\/","title":{"rendered":"Accepted papers"},"content":{"rendered":"\n<ul class=\"wp-block-list\">\n<li>Eugene Asarin, Aldric Degorre, Catalin Dima and Bernardo Jacobo Incl\u00e1n: <strong>Computing the Bandwidth of Meager Timed Automata<\/strong><\/li>\n\n\n\n<li>Aaron Barnoff, Curtis Bright and Jeffrey Shallit: <strong>Using finite automata to compute the base-b representation of the golden ratio and other quadratic irrationals<\/strong><\/li>\n\n\n\n<li>Robert Baumgartner and Sicco Verwer: <strong>PDFA distillation with error bound guarantees<\/strong><\/li>\n\n\n\n<li>Martin Berglund, Willeke Martens and Brink van der Merwe: <strong>Constructing a BPE Tokenization DFA<\/strong><\/li>\n\n\n\n<li>Yohan Boichut, Adrien Boiret and Vincent Hugot: <strong>SAT-Based Automated Completion for Reachability Analysis<\/strong><\/li>\n\n\n\n<li>Bernard Boigelot, Pascal Fontaine and Baptiste Vergain: <strong>Non-Emptiness Test for Automata over Words Indexed by the Reals and Rationals<\/strong><\/li>\n\n\n\n<li>Simon Dieck and Sicco Verwer: <strong>On bidirectional deterministic finite automata<\/strong><\/li>\n\n\n\n<li>Guilherme Duarte, Nelma Moreira, Luca Prigioniero and Rog\u00e9rio Reis: <strong>Block Languages and their Bitmap Representations<\/strong><\/li>\n\n\n\n<li>Attila Egri-Nagy and Chrystopher Nehaniv: <strong>From Relation to Emulation and Interpretation: Computer Algebra Implementation of the Covering Lemma for Finite Transformation Semigroups<\/strong><\/li>\n\n\n\n<li>Hermann Gruber, Markus Holzer and Christian Rauch: <strong>On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract)<\/strong><\/li>\n\n\n\n<li>Luisa Herrmann and Richard M\u00f6rbitz: <strong>Global One-Counter Tree Automata<\/strong><\/li>\n\n\n\n<li>Michal Hospod\u00e1r, Viktor Olej\u00e1r and Juraj \u0160ebej: <strong>Decision Problems for Subregular Classes<\/strong><\/li>\n\n\n\n<li>Jozef Jir\u00e1sek, Galina Jir\u00e1skov\u00e1 and Jeffrey Shallit: <strong>State Complexity of the Minimal Star Basis<\/strong><\/li>\n\n\n\n<li>Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci and Matthias Wendlandt: <strong>On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters<\/strong><\/li>\n\n\n\n<li>Sebastian Maneth and Viet Anh Martin Vu: <strong>Attributed Tree Transducers for Partial Functions<\/strong><\/li>\n\n\n\n<li>Antoine Martin, Alexandre Duret-Lutz and Etienne Renault: <strong>Translation of Semi-Extended Regular Expressions using Derivatives<\/strong><\/li>\n\n\n\n<li>Olga Martynova: <strong>Exact descriptional complexity of determinization of input-driven pushdown automata<\/strong><\/li>\n\n\n\n<li>Keisuke Nakano and Munehiro Iwami: <strong>Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata<\/strong><\/li>\n\n\n\n<li>Dirk Nowotka and Max Wiedenh\u00f6ft: <strong>The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable<\/strong><\/li>\n\n\n\n<li>Giovanni Pighizzini: <strong>Push Complexity: Optimal Bounds and Unary Inputs<\/strong><\/li>\n\n\n\n<li>Maria Radionova and Alexander Okhotin: <strong>Decision problems for reversible and permutation automata<\/strong><\/li>\n\n\n\n<li>Alexander Roodt, Brendan Watling, Willem Bester, Brink van der Merwe, Sicheol Sung and Yo-Sub Han: <strong>Benchmarking Regular Expression Matching<\/strong><\/li>\n\n\n\n<li>Tang Tianxiang and Vladimir Zakharov: <strong>On the Complexity of Decision Problems for Parameterized Finite State Synchronous Transducers<\/strong><\/li>\n\n\n\n<li>Takao Yuyama and Ryoma Sin&#8217;Ya: <strong>Measuring Power of Commutative Group Languages<\/strong><\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-227","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"http:\/\/www.math.akita-u.ac.jp\/ciaa2024\/index.php\/wp-json\/wp\/v2\/pages\/227","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/www.math.akita-u.ac.jp\/ciaa2024\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"http:\/\/www.math.akita-u.ac.jp\/ciaa2024\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"http:\/\/www.math.akita-u.ac.jp\/ciaa2024\/index.php\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"http:\/\/www.math.akita-u.ac.jp\/ciaa2024\/index.php\/wp-json\/wp\/v2\/comments?post=227"}],"version-history":[{"count":4,"href":"http:\/\/www.math.akita-u.ac.jp\/ciaa2024\/index.php\/wp-json\/wp\/v2\/pages\/227\/revisions"}],"predecessor-version":[{"id":232,"href":"http:\/\/www.math.akita-u.ac.jp\/ciaa2024\/index.php\/wp-json\/wp\/v2\/pages\/227\/revisions\/232"}],"wp:attachment":[{"href":"http:\/\/www.math.akita-u.ac.jp\/ciaa2024\/index.php\/wp-json\/wp\/v2\/media?parent=227"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}