{"id":116,"date":"2026-08-04T06:38:23","date_gmt":"2026-08-04T06:38:23","guid":{"rendered":"https:\/\/math.utu.fi\/rp26\/?page_id=116"},"modified":"2026-08-12T18:08:16","modified_gmt":"2026-08-12T18:08:16","slug":"accepted-papers","status":"publish","type":"page","link":"https:\/\/math.utu.fi\/rp26\/accepted-papers\/","title":{"rendered":"Accepted papers"},"content":{"rendered":"<h3><em>Regular Papers<\/em><\/h3>\n<ul>\n<li>Wojciech Czerwi\u0144ski and \u0141ukasz Orlikowski<br \/><span style=\"color: #000000\"><strong>Language Equivalence is Undecidable in VASS with Restricted Nondeterminism<\/strong><\/span><b><br \/><\/b><\/li>\n<li>Duncan Adamson, Pamela Fleischmann, Annika Huch, Tim L\u00f6ck, Dirk Nowotka and Christian Rauch<br \/><span style=\"color: #000000\"><strong>Word-Representability of Directed Graphs<\/strong><\/span><b><br \/><\/b><\/li>\n<li>Sully Mak, Guillaume Cantin and Beno\u00eet Delahaye<br \/><span style=\"color: #000000\"><strong>Formal analysis of hybrid systems using parametric Statistical Model Checking<\/strong><\/span><b><br \/><\/b><\/li>\n<li>\u0141ukasz Kami\u0144ski and S\u0142awomir Lasota<br \/><span style=\"color: #000000\"><strong>Reachability in 3-VAS<\/strong><\/span><b><br \/><\/b><\/li>\n<li>Domenico Cantone, Pietro Maugeri and Stefano Savino<br \/><span style=\"color: #000000\"><strong>Decidability and NP-Completeness of Reachability-Sensitive Graph Constraints with Components, Acyclicity, and Ways<\/strong><\/span><b><br \/><\/b><\/li>\n<li>Michael C. Chavrimootoo and Jin Seok Youn<br \/><span style=\"color: #000000\"><strong>Carrying is Hard: Exploring the Gap between Hardness for NP and PSPACE for the Hanano and Jelly no Puzzles<\/strong><\/span><b><br \/><\/b><\/li>\n<li>Catalin Dima, Mariem Hammami and Youssouf Oualhadj<br \/><span style=\"color: #000000\"><strong>Logical and Strategic Preservation in Compact Rectangular Games<\/strong><\/span><b><br \/><\/b><\/li>\n<li>Fabian Lehr and Florian Bruse<br \/><span style=\"color: #000000\"><strong>Finite Convergence of the Modal $\\mu$-Calculus on Almost Periodic Words<\/strong><\/span><b><br \/><\/b><\/li>\n<li>Paul Bell, Eva Foster, Daniel Reidenbach and Pavel Semukhin<br \/><span style=\"color: #000000\"><strong>Factorisability of Low Dimensional Non-Negative Integer Matrices<\/strong><\/span><b><br \/><\/b><\/li>\n<li>Maxence Ponsardin and Ville Salo<br \/><span style=\"color: #000000\"><strong>Thinking outside the box is useless<\/strong><\/span><b><br \/><\/b><\/li>\n<li>Mikhail Volkov and Yinfeng Zhu<br \/><span style=\"color: #000000\"><strong>Completely Reachable Road Coloring<\/strong><\/span><b><br \/><\/b><\/li>\n<\/ul>\n<h3><em>Presentations<\/em><\/h3>\n<ul>\n<li>Olivier Bournez, Johanne Cohen, Laura Cohen and Adrian Wurm<br \/><span style=\"color: #000000\"><strong>Reachability in Constant-Width Neural Networks: from Turing-Machine Simulation to a Complete Complexity Classification<\/strong><\/span><b><br \/><\/b><\/li>\n<li>Anton Varonka and Kazuki Watanabe<br \/><span style=\"color: #000000\"><strong>On Piecewise Affine Reachability with Bellman Operators<\/strong><\/span><b><br \/><\/b><\/li>\n<li>Gabriel Istrate<br \/><span style=\"color: #000000\"><strong>Hypergraph Versions of Fates&#8217;s Asynchronous Parity Dynamics<\/strong><\/span><b><br \/><\/b><\/li>\n<li>Piotr Bacik and Anton Varonka<br \/><span style=\"color: #000000\"><strong>On the Subspace Orbit Problem and Simultaneous Skolem Problem<\/strong><\/span><b><br \/><\/b><\/li>\n<li>Dietrich Kuske<br \/><span style=\"color: #000000\"><strong>Boolean combinations of omega-rational trace languages: emptiness, rationality, regularity<\/strong><\/span><b><br \/><\/b><\/li>\n<li>Karla Messing<br \/><span style=\"color: #000000\"><strong>Witnesses for Fixpoint Games on Lattices (informal presentation)<\/strong><\/span><b><br \/><\/b><\/li>\n<li>Piotr Bacik, Joris Nieuvweld, Jo\u00ebl Ouaknine, Mihir Vahanwala, Madhavan Venkatesh and Emil Rugaard Wieser<br \/><span style=\"color: #000000\"><strong>On Variable-Bounded Non-Linear Expansions of Presburger Arithmetic<\/strong><\/span><b><br \/><\/b><\/li>\n<li>Tymofii Prokopenko<br \/><span style=\"color: #000000\"><strong>Cops and Robbers on Graphs Under Zero-Visibility Constraints<\/strong><\/span><b><br \/><\/b><\/li>\n<li>Nicole Schirrmacher<br \/><span style=\"color: #000000\"><strong>Logics Between FO and CMSO: Expressive Power and Model Checking<\/strong><\/span><b><br \/><\/b><\/li>\n<li>Filip Cano, Thomas Henzinger, Konstantin Kueffner and Ege Sara\u00e7<br \/><span style=\"color: #000000\"><strong>Monitoring Discounted Sum Properties<\/strong><\/span><b><br \/><\/b><\/li>\n<li>Irmak Saglam<br \/><span style=\"color: #000000\"><strong>In\ufb01nite-state games with energy objectives beyond counters<\/strong><\/span><b><br \/><\/b><\/li>\n<li>Katariina Paturi<br \/><span style=\"color: #000000\"><strong>Minimality, transitivity and sensitivity of non-uniform cellular automata<\/strong><\/span><b><br \/><\/b><\/li>\n<\/ul>\n\n\n<p class=\"wp-block-paragraph\"><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Regular Papers Wojciech Czerwi\u0144ski and \u0141ukasz OrlikowskiLanguage Equivalence is Undecidable in VASS with Restricted Nondeterminism Duncan Adamson, Pamela Fleischmann, Annika Huch, Tim L\u00f6ck, Dirk Nowotka and Christian RauchWord-Representability of Directed Graphs Sully Mak, Guillaume Cantin and Beno\u00eet DelahayeFormal analysis of hybrid systems using parametric Statistical Model Checking \u0141ukasz Kami\u0144ski and S\u0142awomir LasotaReachability in 3-VAS Domenico [&hellip;]<\/p>\n","protected":false},"author":9,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-116","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/math.utu.fi\/rp26\/wp-json\/wp\/v2\/pages\/116","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/math.utu.fi\/rp26\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/math.utu.fi\/rp26\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/math.utu.fi\/rp26\/wp-json\/wp\/v2\/users\/9"}],"replies":[{"embeddable":true,"href":"https:\/\/math.utu.fi\/rp26\/wp-json\/wp\/v2\/comments?post=116"}],"version-history":[{"count":4,"href":"https:\/\/math.utu.fi\/rp26\/wp-json\/wp\/v2\/pages\/116\/revisions"}],"predecessor-version":[{"id":126,"href":"https:\/\/math.utu.fi\/rp26\/wp-json\/wp\/v2\/pages\/116\/revisions\/126"}],"wp:attachment":[{"href":"https:\/\/math.utu.fi\/rp26\/wp-json\/wp\/v2\/media?parent=116"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}