- Interpreted Higher-Dimensional Automata for Concurrent Discrete-Event Control Dylan Bellier Gregory Faraut Yan Monier Philipp Schlehuber-Caissier Tue 31 March 2026
- Shuffles of Context-Free Languages along Regular Trajectories Corentin Barloy Michael Cadilhac Kyle Ockerlund Tue 31 March 2026
- Nominal Automata with Name Deallocation Simon Prucker Stefan Milius Lutz Schrøder Tue 31 March 2026
- Optimizing an LTS-Simulation Algorithm (Technical Report) Lukáš Holík Jiří Šimáček Fri 20 March 2026
- Visibly Recursive Automata Kévin Dubrulle Véronique Bruyère Guillermo A. Pérez Gaetan Staquet Tue 17 March 2026
- History-Deterministic Buchi Automata are Succinct Antonio Casares Aditya Prakash K.~S. Thejaswini Sat 07 March 2026
- Reachability in VASS Extended with Integer Counters Clotilde Bizière Wojciech Czerwiński Roland Guttenberg Jérôme Leroux Vincent Michielini Łukasz Orlikowski Antoni Puch Henry Sinclair-Banks Sat 07 March 2026
- Length Generalization Bounds for Transformers Andy Yang Pascal Bergstraßer Georg Zetzsche David Chiang Anthony W. Lin Thu 05 March 2026
- Localising Stochasticity in Weighted Automata Smayan Agarwal Aalok Thakkar Tue 03 March 2026
- LeanCat: A Benchmark Suite for Formal Category Theory in Lean (Part I: 1-Categories) Rongge Xu Hui Dai Yiming Fu Jiedong Jiang Tianjiao Nie Hongwei Wang Junkai Wang Holiverse Yang Jiatong Yang Zhi-Hao Zhang Sat 28 February 2026
- Expregular functions Thomas Colcombet Nathan Lhote Pierre Ohlmann Thu 26 February 2026
- History-Constrained Systems Louwe B. Kuijer David Purser Henry Sinclair-Banks Patrick Totzke Tue 24 February 2026
- Exploring VASS Parameterised by Geometric Dimension Wojciech Czerwiński Roland Guttenberg Łukasz Orlikowski Henry Sinclair-Banks Yangluo Zheng Fri 20 February 2026
- Out-of-Order Membership to Regular Languages Antoine Amarilli Sebastien Labbe Charles Paperman Wed 18 February 2026
- An Automata-Based Approach to Games with -Automatic Preferences Véronique Bruyère Emmanuel Filiot Christophe Grandmont Jean-François Raskin Thu 12 February 2026
- Computing the Reachability Value of Posterior-Deterministic POMDPs Nathanael Fijalkow Arka Ghosh Roman Kniazev Guillermo A. Pérez Pierre Vandenhove Thu 12 February 2026
- Automata on Graph Alphabets Hugo Bazille Uli Fahrenberg Thu 12 February 2026
- Eve-positional languages: putting order into Buchi automata Olivier Idir Thu 12 February 2026
- A Complexity Bound for Determinisation of Min-Plus Weighted Automata Shaull Almagor Guy Arbel Sarai Sheinvald Thu 05 February 2026
- The complexity of downward closures of indexed languages Richard Mandel Corto Mascle Georg Zetzsche Sun 01 February 2026
- Minimal History-Deterministic Co-Buchi Automata: Congruences and Passive Learning Christof Løding Igor Walukiewicz Sun 01 February 2026
- Commutative algebras of series Lorenzo Clemente Sun 01 February 2026
- Variants of Higher-Dimensional Automata Hugo Bazille Jérémy Dubut Uli Fahrenberg Krzysztof Ziemiański Tue 27 January 2026
- Algebraic Characterizations of Classes of Regular Languages in DynFO Corentin Barloy Felix Tschirbs Nils Vortmeier Thomas Zeume Tue 27 January 2026
- Well-quasi-ordered classes of bounded clique-width Mael Dumas Aliaume Lopez Tue 27 January 2026
- Layered automata: A canonical model for automata over infinite words Antonio Casares Christof Løding Igor Walukiewicz Sat 24 January 2026
- A Myhill-Nerode Characterization and Active Learning for One-Clock Timed Automata Kyveli Doveri Pierre Ganty B. Srivathsan Sat 24 January 2026
- From Trees to Tree-Like: Distribution and Synthesis for Asynchronous Automata Mathieu Lehaut Anca Muscholl Nir Piterman Thu 22 January 2026
- Reversible Weighted Automata over Finite Rings and Monoids with Commuting Idempotents Peter Kostolányi Andrej Ravinger Sun 18 January 2026
- Generalised Quantifiers Based on Rabin-Mostowski Index Denis Kuperberg Damian Niwiński Paweł Parys Michał Skrzypczak Mon 12 January 2026
- A short proof of a bound on the size of finite irreducible semigroups of rational matrices Benjamin Steinberg Sat 10 January 2026
- A pumping-like lemma for languages over infinite alphabets Yoav Danieli Fri 09 January 2026
- Parameterized Verification of Quantum Circuits (Technical Report) Parosh Aziz Abdulla Yu-Fang Chen Michal Hečko Lukáš Holík Ondřej Lengál Jyun-Ao Lin Ramanathan S. Thinniyam Mon 05 January 2026
- Probabilistic Programming Meets Automata Theory: Exact Inference using Weighted Automata Dominik Geißler Tobias Winkler Tue 16 December 2025
- Adding Reconfiguration to Zielonka's Asynchronous Automata Mathieu Lehaut Nir Piterman Mon 15 December 2025
- Weakly-unambiguous Parikh automata and their link to holonomic series Alin Bostan Arnaud Carayol Florent Koechlin Cyril Nicaud Thu 11 December 2025
- Unambiguisability and Register Minimisation of Min-Plus Models Shaull Almagor Guy Arbel Sarai Sheinvald Thu 11 December 2025
- Bounded treewidth, multiple context-free grammars, and downward closures C. Aiswarya Pascal Baumann Prakash Saivasan Lia Schutze Georg Zetzsche Fri 05 December 2025
- General Decidability Results for Systems with Continuous Counters A.~R. Balasubramanian Matthew Hague Rupak Majumdar Ramanathan S. Thinniyam Georg Zetzsche Thu 27 November 2025
- The Role of Logic and Automata in Understanding Transformers Anthony W. Lin Pablo Barcelo Wed 26 November 2025
- Algebraic Closure of Matrix Sets Recognized by 1-VASS Rida Ait El Manssour Mahsa Naraghi Mahsa Shirmohammadi James Worrell Wed 26 November 2025
- Register Automata with Permutations Mrudula Balachander Emmanuel Filiot Raffaella Gentilini Nikos Tzevelekos Sun 24 August 2025
- Reachability in symmetric VASS Łukasz Kamiński Sławomir Lasota Sat 05 July 2025
- A Collapse of the Parity Index Hierarchy of Tree Automata, Based on Cantor-Bendixson Ranks Karoliina Lehtinen Nathan Lhote Sat 05 July 2025
- On the Reachability Problem for Two-Dimensional Branching VASS Clotilde Bizière Thibault Hilaire Jérôme Leroux Grégoire Sutre Sat 05 July 2025
- Submonoid Membership in n-dimensional lamplighter groups and S-unit equations Ruiwen Dong Mon 05 May 2025
- Approximate Problems for Finite Transducers Emmanuel Filiot Ismael Jecker Khushraj Madnani Saina Sunny Fri 25 April 2025
- Dynamic Membership for Regular Tree Languages Antoine Amarilli Corentin Barloy Louis Jachiet Charles Paperman Fri 25 April 2025
- Resolving Nondeterminism by Chance Soumyajit Paul David Purser Sven Schewe Qiyi Tang Patrick Totzke Di-De Yen Fri 25 April 2025
- Synthesising Asynchronous Automata from Fair Specifications Béatrice Bérard Benjamin Monmege B Srivathsan Arnab Sur Fri 25 April 2025
- The complexity of reachability problems in strongly connected finite automata Stefan Kiefer Andrew Ryzhikov Fri 25 April 2025
- Reachability in Geometrically d-Dimensional VASS Yuxi Fu Yangluo Zheng Qizhe Yang Fri 25 April 2025
- Languages of Boundedly-Ambiguous Vector Addition Systems with States Wojciech Czerwiński Łukasz Orlikowski Fri 25 April 2025
- Undecidability of the Emptiness Problem for Weak Models of Distributed Computing Flavio T. Principato Javier Esparza Philipp Czerner Thu 24 April 2025
- Active Learning of Deterministic Transducers with Outputs in Arbitrary Monoids Quentin Aristote Thu 24 April 2025
- String Diagrammatic Trace Theory Matthew Earnshaw Paweł Sobociński Fri 18 April 2025
- Thin Coalgebraic Behaviours Are Inductive Anton Chernev Corina Cîrstea Helle Hvid Hansen Clemens Kupke Fri 11 April 2025
- PVASS Reachability is Decidable Roland Guttenberg Eren Keskin Roland Meyer Thu 10 April 2025
- The 2-Token Theorem: Recognising History-Deterministic Parity Automata Efficiently Karoliina Lehtinen Aditya Prakash Sat 05 April 2025
- Determinization of Min-Plus Weighted Automata is Decidable Shaull Almagor Guy Arbel Sarai Sheinvald Sat 05 April 2025
- Pseudovarieties of semigroups Jorge Almeida Sat 05 April 2025
- When is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic Sebastian Maneth Helmut Seidl Sat 05 April 2025
- Rerailing Automata Rudiger Ehlers Sat 05 April 2025
- Algorithmic analysis of systems with affine input and polynomial state Lorenzo Clemente Thu 03 April 2025
- Algebras for Automata: Reasoning with Regularity (Invited Talk) Anupam Das Mon 17 March 2025
- The memory of ømega-regular and BC(Sigma2^0) objectives Antonio Casares Pierre Ohlmann Fri 14 March 2025
- Effective Reductions of Mealy Machines Florian Renkin Philipp Schlehuber-Caissier Alexandre Duret-Lutz Adrien Pommellet Sun 09 March 2025
- Membership Problems in Finite Groups Markus Lohrey Andreas Rosowski Georg Zetzsche Sun 09 March 2025
- Regular Languages in the Sliding Window Model Moses Ganardi Danny Hucke Markus Lohrey Konstantinos Mamouras Tatiana Starikovskaya Sun 09 March 2025
- Formalizing zeta and L-functions in Lean David Loeffler Michael Stoll Sun 09 March 2025
- Learning Deterministic One-Counter Automata in Polynomial Time Prince Mathew Vincent Penelle A.~V. Sreejith Sun 09 March 2025
- Soundness of reset workflow nets Michael Blondin Alain Finkel Piotr Hofman Filip Mazowiecki Philip Offtermatt Sun 09 March 2025
- On Decidability Timed Automata with 2 Parametric Clocks Marcello M. Bersani Matteo Rossi Pierluigi San Pietro Sun 09 March 2025
- Lexicographic transductions of finite words Emmanuel Filiot Pierre-Alain Reynier Nathan Lhote Sun 09 March 2025
- Resolving Nondeterminism with Randomness Thomas A. Henzinger Aditya Prakash K. S. Thejaswini Wed 26 February 2025
- The Agafonov and Schnorr-Stimm theorems for probabilistic automata Laurent Bienvenu Hugo Gimbert Subin Pulari Wed 26 February 2025
- Reachability in Trace-Pushdown Systems Chris Køcher Dietrich Kuske Tue 25 February 2025
- Constant-delay enumeration for SLP-compressed documents Martín Muñoz Cristian Riveros Tue 25 February 2025
- Data Structures for Finite Downsets of Natural Vectors: Theory and Practice Michael Cadilhac Vanessa Flğel Guillermo A. Pérez Shrisha Rao Tue 25 February 2025
- Recognizing Numbers Pranshu Gaba Arnab Sur Tue 25 February 2025
- Nondeterministic tree-walking automata are not closed under complementation Olga Martynova Alexander Okhotin Tue 18 February 2025
- Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests Roland Guttenberg Wojciech Czerwiński Sławomir Lasota Fri 14 February 2025
- Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata Filip Mazowiecki Antoni Puch Daniel Smertnig Fri 14 February 2025
- Navigational hierarchies of regular languages Thomas Place Marc Zeitoun Fri 14 February 2025
- Cerny type automata and rank conjecture Igor Rystsov Fri 14 February 2025
- Nonnegativity Problems for Matrix Semigroups Julian D'Costa Joël Ouaknine James Worrell Thu 06 February 2025
- Model-checking real-time systems: revisiting the alternating automaton route Patricia Bouyer B Srivathsan Vaishnavi Vishwanath Fri 31 January 2025
- Completing the picture for the Skolem Problem on order-4 linear recurrence sequences Piotr Bacik Wed 29 January 2025
- The structure of polynomial growth for tree automata/transducers and MSO set queries Paul Gallot Nathan Lhote Lê Thành Dũng Nguyên Wed 29 January 2025
- History-Deterministic Parity Automata: Games, Complexity, and the 2-Token Theorem Aditya Prakash Wed 29 January 2025
- Fined-Grained Complexity of Ambiguity Problems on Automata and Directed Graphs Karolina Drabik Anita Durr Fabian Frei Filip Mazowiecki Karol Węgrzycki Wed 29 January 2025
- A polynomial-time algorithm for the automatic Baire property Ludwig Staiger Wed 29 January 2025
- The Alternation Hierarchy of First-Order Logic on Words is Decidable Corentin Barloy Michael Cadilhac Charles Paperman Howard Straubing Wed 29 January 2025
- Well-Quasi-Orderings on Word Languages Nathan Lhote Aliaume Lopez Lia Schutze Wed 15 January 2025
- Transformers in Uniform TC^0 David Chiang Tue 07 January 2025
- Reachability in Vector Addition System with States Parameterized by Geometric Dimension Yangluo Zheng Mon 06 January 2025
- The Black Ninjas and the Sniper: On Robustness of Population Protocols Benno Lossin Philipp Czerner Javier Esparza Roland Guttenberg Tobias Prehn Mon 06 January 2025
- Bounded languages described by GF(2)-grammars Vladislav Makarov Fri 29 November 2024
- Finer characterization of bounded languages described by GF(2)-grammars Vladislav Makarov Marat Movsin Fri 29 November 2024
- Equivalence of Deterministic Weighted Real-time One-Counter Automata Prince Mathew Vincent Penelle Prakash Saivasan A.~V. Sreejith Mon 25 November 2024
- Learning real-time one-counter automata using polynomially many queries Prince Mathew Vincent Penelle A.~V. Sreejith Mon 25 November 2024
- Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable Clotilde Bizière Wojciech Czerwiński Thu 07 November 2024
- Decidability Issues for Petri Nets -- a survey Javier Esparza Mogens Nielsen Thu 07 November 2024
- Masked Hard-Attention Transformers Recognize Exactly the Star-Free Languages Andy Yang David Chiang Dana Angluin Sat 02 November 2024
- Explorable Parity Automata Emile Hazard Olivier Idir Denis Kuperberg Sat 02 November 2024
- Automata Size Reduction by Procedure Finding Michal Šedý Lukáš Holík Sat 02 November 2024
- Verifying Quantum Circuits with Level-Synchronized Tree Automata (Technical Report) Parosh Aziz Abdulla Yo-Ga Chen Yu-Fang Chen Lukáš Holík Ondřej Lengál Jyun-Ao Lin Fang-Yi Lo Wei-Lun Tsai Sat 02 November 2024
- A Uniform Framework for Problems on Context-Free Grammars Javier Esparza Peter Rossmanith Stefan Schwoon Sat 02 November 2024
- A LOCAL View of the Polynomial Hierarchy Fabian Reiter Sat 26 October 2024
- Computing measures of weak-MSO definable sets of trees Damian Niwiński Marcin Przybyłko Michał Skrzypczak Sat 26 October 2024
- Beyond Decisiveness of Infinite Markov Chains Benoît Barbot Patricia Bouyer Serge Haddad Sat 12 October 2024
- Conway's cosmological theorem and automata theory Pierre Lairez Aleksandr Storozhenko Sat 12 October 2024
- The complexity of separability for semilinear sets and Parikh automata Elias Rojas Collins Chris Køcher Georg Zetzsche Sat 12 October 2024
- A Naturally-Colored Translation from LTL to Parity and COCOA Rudiger Ehlers Ayrat Khalimov Sat 12 October 2024
- Transformers as Transducers Lena Strobl Dana Angluin David Chiang Jonathan Rawski Ashish Sabharwal Sat 12 October 2024
- A Myhill-Nerode style Characterization for Timed Automata With Integer Resets Kyveli Doveri Pierre Ganty B. Srivathsan Sat 12 October 2024
- The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds Karl Bringmann Allan Grønlund Marvin Kunnemann Kasper Green Larsen Sat 12 October 2024
- A New Notion of Regularity: Finite State Automata Accepting Graphs Yvo Ad Meeres Sat 12 October 2024
- Presheaf automata Georg Struth Krzysztof Ziemiański Sat 12 October 2024
- Factoring through monomial representations: arithmetic characterizations and ambiguity of weighted automata Daniel Smertnig Antoni Puch Sat 12 October 2024
- Equations in wreath products Laurent Bartholdi Ruiwen Dong Leon Pernak Jan Philipp Wachter Sat 12 October 2024
- A Usage-Aware Sequent Calculus for Differential Dynamic Logic Myra Dotzel Stefan Mitsch André Platzer Sat 12 October 2024
- Query Learning of Advice and Nominal Automata Kevin Zhou Tue 24 September 2024
- Algebraic power series and their automatic complexity II: modulo prime powers Eric Rowland Reem Yassawi Tue 24 September 2024
- Dual Adjunction Between Omega-Automata and Wilke Algebra Quotients Anton Chernev Helle Hvid Hansen Clemens Kupke Wed 14 August 2024
- Parameterized Verification of Systems with Precise (0,1)-Counter Abstraction Paul Eichler Swen Jacobs Chana Weil-Kennedy Wed 14 August 2024
- Parameterized Verification of Timed Networks with Clock Invariants Étienne André Swen Jacobs Shyam Lal Karra Ocan Sankur Wed 14 August 2024
- Alternating Nominal Automata with Name Allocation Florian Frank Daniel Hausmann Stefan Milius Lutz Schrøder Henning Urbat Wed 14 August 2024
- Simple grammar bisimilarity, with an application to session type equivalence Diogo Poças Vasco T. Vasconcelos Thu 01 August 2024
- The Existential Theory of the Reals as a Complexity Class: A Compendium Marcus Schaefer Jean Cardinal Tillmann Miltzow Wed 31 July 2024
- On the Minimisation of Deterministic and History-Deterministic Generalised (co)Buchi Automata Antonio Casares Olivier Idir Denis Kuperberg Corto Mascle Aditya Prakash Wed 31 July 2024
- Reachability for Multi-Priced Timed Automata with Positive and Negative Rates Andrew Scoones Mahsa Shirmohammadi James Worrell Wed 31 July 2024
- Faster and Smaller Solutions of Obliging Games Daniel Hausmann Nir Piterman Wed 24 July 2024
- Learning Weighted Finite Automata over the Max-Plus Semiring and its Termination Takamasa Okudono Masaki Waga Taro Sekiyama Ichiro Hasuo Wed 24 July 2024
- MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm S. Akshay Paul Gastin R. Govind B. Srivathsan Wed 24 July 2024
- History-Determinism vs Fair Simulation Udi Boker Thomas A. Henzinger Karoliina Lehtinen Aditya Prakash Mon 15 July 2024
- The single-use restriction for register automata and transducers over infinite alphabets Rafał Stefański Mon 15 July 2024
- On Tree Automata, Generating Functions, and Differential Equations Rida Ait El Manssour Vincent Cheval Mahsa Shirmohammadi James Worrell Sat 13 July 2024
- An automata-based approach for synchronizable mailbox communication Romain Delpy Anca Mushcoll Grégoire Sutre Thu 11 July 2024
- Weighted basic parallel processes and combinatorial enumeration Lorenzo Clemente Wed 10 July 2024
- On Shuffling and Splitting Automata Ignacio Mollo Cunningham Fri 05 July 2024
- Monads, Comonads, and Transducers Rafał Stefański Fri 05 July 2024
- Unveiling the connection between the Lyndon factorization and the Canonical Inverse Lyndon factorization via a border property Paola Bonizzoni Clelia De Felice Brian Riccardi Rocco Zaccagnino Rosalba Zizza Tue 02 July 2024
- Minimising the Probabilistic Bisimilarity Distance Stefan Kiefer Qiyi Tang Tue 02 July 2024
- The Complexity of Simplifying ømega-Automata through the Alternating Cycle Decomposition Antonio Casares Corto Mascle Mon 01 July 2024
- The Power of Counting Steps in Quantitative Games Sougata Bose Rasmus Ibsen-Jensen David Purser Patrick Totzke Pierre Vandenhove Thu 27 June 2024
- Positive and monotone fragments of FO and LTL Denis Kuperberg Quentin Moreau Thu 27 June 2024
- Addition in Dumont-Thomas Numeration Systems in Theory and Practice Olivier Carton Jean-Michel Couvreur Martin Delacourt Nicolas Ollinger Sun 23 June 2024
- Reversible Transducers over Infinite Words Luc Dartois Paul Gastin Loic Germerie Guizouarn R. Govind Shankaranarayanan Krishna Sun 23 June 2024
- A Subclass of Mu-Calculus with the Freeze Quantifier Equivalent to Buchi Register Automata Yoshiaki Takata Akira Onishi Ryoma Senda Hiroyuki Seki Sun 23 June 2024
- Computing the Bandwidth of Meager Timed Automata Eugene Asarin Aldric Degorre Catalin Dima Bernardo Jacobo Inclán Sun 23 June 2024
- Quantum automata and languages of finite index Andrea Benso Flavio D'Alessandro Paolo Papi Sun 23 June 2024
- On Rational Recursion for Holonomic Sequences Bertrand Teguia Tabuguia James Worrell Tue 18 June 2024
- Separability in Buchi Vass and Singly Non-Linear Systems of Inequalities Pascal Baumann Eren Keskin Roland Meyer Georg Zetzsche Fri 07 June 2024
- Linear equations and recursively enumerable sets Juha Honkala Fri 07 June 2024
- On shortest products for nonnegative matrix mortality Andrew Ryzhikov Fri 31 May 2024
- The CFG Complexity of Singleton Sets Lance Fortnow William Gasarch Fri 31 May 2024
- The Power of Hard Attention Transformers on Data Sequences: A Formal Language Theoretic Perspective Pascal Bergstraßer Chris Køcher Anthony Widjaja Lin Georg Zetzsche Fri 31 May 2024
- Lindenmayer graph languages, first-order theories and expanders Teodor Knapik Thu 30 May 2024
- Bi-reachability in Petri nets with data Łukasz Kamiński Sławomir Lasota Thu 30 May 2024
- Nominal Tree Automata With Name Allocation Simon Prucker Lutz Schrøder Tue 28 May 2024
- Jumping Automata Must Pay Shaull Almagor Ishai Salgado Wed 22 May 2024
- Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages Bharat Adsul Paul Gastin Shantanu Kulkarni Pascal Weil Wed 22 May 2024
- Weighted Automata and Expressions over Pre-Rational Monoids Nicolas Baudru Louis-Marie Dando Nathan Lhote Benjamin Monmege Pierre-Alain Reynier Jean-Marc Talbot Tue 21 May 2024
- Containment Problem for Deterministic Multicounter Machine Models Oscar H. Ibarra Ian McQuillan Fri 17 May 2024
- Verifying Unboundedness via Amalgamation Ashwani Anand Sylvain Schmitz Lia Schutze Georg Zetzsche Fri 17 May 2024
- On Transcendence of Numbers Related to Sturmian and Arnoux-Rauzy Words Pavol Kebis Florian Luca Joel Ouaknine Andrew Scoones James Worrell Thu 16 May 2024
- Slice closures of indexed languages and word equations with counting constraints Laura Ciobanu Georg Zetzsche Wed 15 May 2024
- Finite-valued Streaming String Transducers Emmanuel Filiot Ismael Jecker Gabriele Puppis Christof Løding Anca Muscholl Sarah Winter Wed 15 May 2024
- Mahler equations for Zeckendorf numeration Olivier Carton Reem Yassawi Thu 09 May 2024
- An efficient quantifier elimination procedure for Presburger arithmetic Christoph Haase Shankara Narayanan Krishna Khushraj Madnani Om Swostik Mishra Georg Zetzsche Wed 08 May 2024
- From the Lyndon factorization to the Canonical Inverse Lyndon factorization: back and forth Paola Bonizzoni Clelia De Felice Rocco Zaccagnino Rosalba Zizza Tue 07 May 2024
- The Algebras for Automatic Relations Rémi Morvan Tue 30 April 2024
- Lookahead Games and Efficient Determinisation of History-Deterministic Btextbackslash''uchi Automata Rohan Acharya Marcin Jurdziński Aditya Prakash Tue 30 April 2024
- Improved Algorithm for Reachability in d-VASS Yuxi Fu Qizhe Yang Yangluo Zheng Mon 29 April 2024
- Functional Closure Properties of Finite mathbbN-weighted Automata Julian Dørfler Christian Ikenmeyer Wed 24 April 2024
- A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata Antoine Amarilli Marcelo Arenas YooJung Choi Mikael Monet Guy Van den Broeck Benjie Wang Thu 18 April 2024
- Implicit automata in łambda-calculi III: affine planar string-to-string functions Cécilia Pradic Ian Price Thu 18 April 2024
- Function spaces for orbit-finite sets Mikołaj Bojańczyk Lê Thành Dũng Nguyên Rafał Stefański Thu 18 April 2024
- A Uniform Framework for Language Inclusion Problems Kyveli Doveri Pierre Ganty Chana Weil-Kennedy Thu 18 April 2024
- Trading Determinism for Noncommutativity in Edmonds' Problem V. Arvind Abhranil Chatterjee Partha Mukhopadhyay Fri 12 April 2024
- The Identity Problem in virtually solvable matrix groups over algebraic numbers Corentin Bodart Ruiwen Dong Fri 05 April 2024
- Logic and Languages of Higher-Dimensional Automata Amazigh Amrane Hugo Bazille Uli Fahrenberg Marie Fortin Sun 31 March 2024
- The Futures of Reactive Synthesis (Dagstuhl Seminar 23391) Nathanaël Fijalkow Bernd Finkbeiner Guillermo A. Pérez Elizabeth Polgreen Rémi Morvan Sat 30 March 2024
- Continuous Pushdown VASS in One Dimension are Easy Guillermo A. Perez Shrisha Rao Sun 03 March 2024
- Tree-Verifiable Graph Grammars Mark Chimes Radu Iosif Florian Zuleger Sun 03 March 2024
- On the Complexity of Initial-and-Final-State Opacity for Discrete Event Systems Tomáš Masopust Petr Osička Sun 03 March 2024
- Introducing q-deformed binomial coefficients of words Antoine Renard Michel Rigo Markus A. Whiteland Thu 29 February 2024
- Flattability of Priority Vector Addition Systems Roland Guttenberg Thu 29 February 2024
- Profinite trees, through monads and the lambda-calculus Vincent Moreau Thu 29 February 2024
- Equivariant ideals of polynomials Arka Ghosh Sławomir Lasota Wed 28 February 2024
- Decidability and k-Regular Sequences Daniel Krenn Jeffrey Shallit Wed 21 February 2024
- Random DFA With One Added Transition Arnaud Carayol Philippe Duchon Florent Koechlin Cyril Nicaud Tue 13 February 2024
- On the Separability Problem of VASS Reachability Languages Eren Keskin Roland Meyer Thu 01 February 2024
- Half-positional ømega-regular languages Antonio Casares Pierre Ohlmann Thu 01 February 2024
- Deterministic Parikh automata on infinite words Mario Grobler Sebastian Siebertz Thu 01 February 2024
- Membership problems in nilpotent groups Corentin Bodart Thu 01 February 2024
- Strongly k-recursive sequences Daniel Krenn Jeffrey Shallit Tue 30 January 2024
- A proof theory of right-linear (omega-)grammars via cyclic proofs Anupam Das Abhishek De Tue 30 January 2024
- Combinatorics on words and generating Dirichlet series of automatic sequences Jean-Paul Allouche Jeffrey Shallit Manon Stipulanti Tue 30 January 2024
- On Dependent Variables in Reactive Synthesis S. Akshay Eliyahu Basa Supratik Chakraborty Dror Fried Tue 30 January 2024
- Satisfiability of Context-free String Constraints with Subword-ordering and Transducers C Aiswarya Soumodev Mal Prakash Saivasan Fri 19 January 2024
- Directed Regular and Context-Free Languages Moses Ganardi Irmak Saglam Georg Zetzsche Fri 19 January 2024
- Automata and coalgebras in categories of species Fosco Loregian Thu 18 January 2024
- On the Boolean Closure of Deterministic Top-Down Tree Automata Christof Løding Wolfgang Thomas Thu 18 January 2024
- Commutative Regular Languages with Product-Form Minimal Automata Stefan Hoffmann Sun 31 December 2023
- Weighted Automata and Logics Meet Computational Complexity Peter Kostolányi Fri 22 December 2023
- Cocke--Younger--Kasami--Schwartz--Zippel algorithm and relatives Vladislav Makarov Sat 16 December 2023
- Automatic Theorem Proving in Walnut Hamoon Mousavi Sat 16 December 2023
- Why the equivalence problem for unambiguous grammars has not been solved back in 1966 Vladislav Makarov Sat 16 December 2023
- Regular Transformations (Dagstuhl Seminar 23202) Rajeev Alur Mikołaj Bojańczyk Emmanuel Filiot Anca Muscholl Sarah Winter Thu 30 November 2023
- Extending the WMSO+U Logic With Quantification Over Tuples Anita Badyl Paweł Parys Thu 30 November 2023
- Concurrent Stochastic Lossy Channel Games Daniel Stan Muhammad Najib Anthony Widjaja Lin Parosh Aziz Abdulla Thu 30 November 2023
- Characterising and Verifying the Core in Concurrent Multi-Player Mean-Payoff Games (Full Version) Julian Gutierrez Anthony W. Lin Muhammad Najib Thomas Steeples Michael Wooldridge Tue 28 November 2023
- Lecture Notes on Partially Known MDPs Guillermo A. Perez Sat 25 November 2023
- Model-checking lock-sharing systems against regular constraints Corto Mascle Sat 25 November 2023
- Priority Downward Closures Ashwani Anand Georg Zetzsche Fri 24 November 2023
- Unboundedness problems for machines with reversal-bounded counters Pascal Baumann Flavio D'Alessandro Moses Ganardi Oscar Ibarra Ian McQuillan Lia Schutze Georg Zetzsche Fri 24 November 2023
- Partially Ordered Automata and Piecewise Testability Tomáš Masopust Markus Krøtzsch Fri 24 November 2023
- Checking Presence Reachability Properties on Parameterized Shared-Memory Systems Nicolas Waldburger Thu 23 November 2023
- Synchronized CTL over One-Counter Automata Shaull Almagor Daniel Assa Udi Boker Thu 23 November 2023
- The Weighted HOM-Problem over Fields Andreea-Teodora Nász Wed 22 November 2023
- Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries Diego Figueira Rémi Morvan Tue 21 November 2023
- Automata-based Quantitative Verification Suguman Bansal Mon 20 November 2023
- Syntactically and semantically regular languages of lambda-terms coincide through logical relations Vincent Moreau Lê Thành Dũng Nguyên Thu 16 November 2023
- Simulation vs. Equivalence Zoltan Esik Andreas Maletti Mon 13 November 2023
- Polyregular functions on unordered trees of bounded height Mikołaj Bojańczyk Bartek Klin Wed 08 November 2023
- Ramsey Quantifiers in Linear Arithmetics Pascal Bergstraßer Moses Ganardi Anthony W. Lin Georg Zetzsche Wed 08 November 2023
- Parikh's Theorem Made Symbolic Matthew Hague Artur Jeż Anthony W. Lin Wed 08 November 2023
- Combinatorics of nondeterministic walks Élie de Panafieu Michael Wallner Tue 07 November 2023
- A symmetric attractor-decomposition lifting algorithm for parity games Marcin Jurdziński Rémi Morvan Pierre Ohlmann K.~S. Thejaswini Mon 06 November 2023
- Intensional Kleene and Rice Theorems for Abstract Program Semantics Paolo Baldan Francesco Ranzato Linpeng Zhang Mon 06 November 2023
- A Myhill-Nerode Theorem for Register Automata and Symbolic Trace Languages Frits Vaandrager Abhisek Midya Mon 06 November 2023
- Definability Results for Top-Down Tree Transducers Sebastian Maneth Helmut Seidl Martin Vu Sun 05 November 2023
- Deciding FO-definability of regular languages Agi Kurucz Vladislav Ryzhikov Yury Savateev Michael Zakharyaschev Sun 05 November 2023
- Mata, a Fast and Simple Finite Automata Library (Technical Report) David Chocholatý Tomáš Fiedor Vojtěch Havlena Lukáš Holík Martin Hruška Ondřej Lengál Juraj Síč Thu 26 October 2023
- Checking History-Determinism is NP-hard for Parity Automata Aditya Prakash Thu 26 October 2023
- On Learning Polynomial Recursive Programs Alex Buna-Marginean Vincent Cheval Mahsa Shirmohammadi James Worrell Thu 26 October 2023
- Proof of Irvine's Conjecture via Mechanized Guessing Jeffrey Shallit Thu 26 October 2023
- Word Equations in Synergy with Regular Constraints (Technical Report) František Blahoudek Yu-Fang Chen David Chocholatý Vojtěch Havlena Lukáš Holík Ondřej Lengál Juraj Síč Sat 21 October 2023
- Word-Mappings of level 3 G. Sénizergues Thu 12 October 2023
- Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata Ismael Jecker Filip Mazowiecki David Purser Thu 05 October 2023
- Acyclic Petri and Workflow Nets with Resets Dmitry Chistikov Wojciech Czerwiński Piotr Hofman Filip Mazowiecki Henry Sinclair-Banks Thu 05 October 2023
- Bandwidth of Timed Automata: 3 Classes Eugene Asarin Aldric Degorre Catalin Dima Bernardo Jacobo Inclan Thu 05 October 2023
- Learning from Positive and Negative Examples: New Proof for Binary Alphabets Jonas Lingg Mateus de Oliveira Oliveira Petra Wolf Wed 04 October 2023
- A note on the power sums of the number of Fibonacci partitions Carlo Sanna Wed 27 September 2023
- Feasibility of Learning Weighted Automata on a Semiring Laure Daviaud Marianne Johnson Fri 15 September 2023
- Pumping Lemmata for Recognizable Weighted Languages over Artinian Semirings Andreas Maletti Nils Oskar Nuernbergk Thu 14 September 2023
- Weighted Automata over Vector Spaces Nada Damljanović Miroslav Ćirić Jelena Ignjatović Thu 14 September 2023
- A General Approach to Proving Properties of Fibonacci Representations via Automata Theory Jeffrey Shallit Sonja Linghui Shan Thu 14 September 2023
- Dimension-Minimality and Primality of Counter Nets Shaull Almagor Guy Avni Henry Sinclair-Banks Asaf Yeshurun Mon 04 September 2023
- Monus semantics in vector addition systems with states Pascal Baumann Khushraj Madnani Filip Mazowiecki Georg Zetzsche Fri 01 September 2023
- Transcendence of Sturmian Numbers over an Algebraic Base Florian Luca Joel Ouaknine James Worrell Tue 29 August 2023
- An Analysis of On-the-fly Determinization of Finite-state Automata Ivan Baburin Ryan Cotterell Tue 29 August 2023
- A note on Christol's theorem Boris Adamczewski Reem Yassawi Mon 28 August 2023
- Algebraic power series and their automatic complexity I: finite fields Eric Rowland Manon Stipulanti Reem Yassawi Mon 28 August 2023
- Proving properties of some greedily-defined integer recurrences via automata theory Jeffrey Shallit Sat 26 August 2023
- Formal Analysis and Verification of Max-Plus Linear Systems Muhammad Syifa'ul Mufid Andrea Micheli Alessandro Abate Alessandro Cimatti Sat 26 August 2023
- Introducing Divergence for Infinite Probabilistic Models Alain Finkel Serge Haddad Lina Ye Sat 26 August 2023
- Algorithmic Verification of Continuous and Hybrid Systems Oded Maler Wed 09 August 2023
- On Streaming String Transducers and HDT0L Systems Emmanuel Filiot Pierre-Alain Reynier Wed 09 August 2023
- Coordination Sequences of Periodic Structures are Rational via Automata Theory Eryk Kopczynski Thu 03 August 2023
- Register Minimization of Cost Register Automata over a Field Yahia Idriss Benalioua Nathan Lhote Pierre-Alain Reynier Sat 29 July 2023
- On the Succinctness of Good-for-MDPs Automata Sven Schewe Qiyi Tang Tue 25 July 2023
- Saturating automata for game semantics Alex Dixon Andrzej S. Murawski Tue 25 July 2023
- Two-way automata and transducers with planar behaviours are aperiodic Lê Thành Dũng Nguy~ên Camille Noûs Cécilia Pradic Fri 21 July 2023
- Timed I/O Automata: It is never too late to complete your timed specification theory Martijn A. Goorden Kim G. Larsen Axel Legay Florian Lorber Ulrik Nyman Andrzej Wasowski Sat 15 July 2023
- Deciding Conjugacy of a Rational Relation C. Aiswarya Amaldev Manuel Saina Sunny Sat 15 July 2023
- A Local-Time Semantics for Negotiations Madhavan Mukund Adwitee Roy B Srivathsan Sat 15 July 2023
- Deterministic pushdown automata can compress some normal sequences Olivier Carton Sylvain Perifel Fri 14 July 2023
- Deciding What is Good-for-MDPs Sven Schewe Qiyi Tang Tansholpan Zhanabekova Fri 14 July 2023
- Primitive Automata that are Synchronizing Igor Rystsov Marek Szykuła Fri 14 July 2023
- Model-checking parametric lock-sharing systems against regular constraints Corto Mascle Anca Muscholl Igor Walukiewicz Thu 13 July 2023
- Safety and Liveness of Quantitative Automata Udi Boker Thomas A. Henzinger Nicolas Mazzocchi N. Ege Saraç Thu 13 July 2023
- Checking Refinement of Asynchronous Programs against Context-Free Specifications Pascal Baumann Moses Ganardi Rupak Majumdar Ramanathan S. Thinniyam Georg Zetzsche Thu 06 July 2023
- Deciding whether an Attributed Translation can be realized by a Top-Down Transducer Sebastian Maneth Martin Vu Thu 06 July 2023
- Semenov Arithmetic, Affine VASS, and String Constraints Andrei Draghici Christoph Haase Florin Manea Thu 06 July 2023
- On asymptotically automatic sequences Jakub Konieczny Thu 22 June 2023
- Constructing Deterministic Parity Automata from Positive and Negative Examples León Bohn Christof Løding Thu 22 June 2023
- Revisiting the growth of polyregular functions: output languages, weighted automata and unary inputs Sandra Kiefer Lê Thành Dũng Nguy~ên Cécilia Pradic Thu 22 June 2023
- Invariants and Home Spaces in Transition Systems and Petri Nets Gerard Memmi Thu 15 June 2023
- Reachability in 3-VASS is in Tower Qizhe Yang Yuxi Fu Tue 13 June 2023
- Getting More out of Large Language Models for Proofs Shizhuo Dylan Zhang Talia Ringer Emily First Mon 05 June 2023
- Checking in Polynomial Time whether or not a Regular Tree Language is Deterministic Top-Down Sebastian Maneth Helmut Seidl Mon 05 June 2023
- Optimal Approximate Minimization of One-Letter Weighted Finite Automata Clara Lacroce Borja Balle Prakash Panangaden Guillaume Rabusseau Mon 05 June 2023
- A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation S Akshay Paul Gastin R Govind Aniruddha R Joshi B Srivathsan Fri 02 June 2023
- Active Learning of Deterministic Timed Automata with Myhill-Nerode Style Characterization Masaki Waga Fri 02 June 2023
- Positive First-order Logic on Words and Graphs Denis Kuperberg Fri 26 May 2023
- On Semantically-Deterministic Automata Bader Abu Radi Orna Kupferman Fri 26 May 2023
- Existential Definability over the Subword Ordering Pascal Baumann Moses Ganardi Ramanathan S. Thinniyam Georg Zetzsche Fri 26 May 2023
- Determinisability of register and timed automata Lorenzo Clemente Sławomir Lasota Radosław Piórkowski Wed 24 May 2023
- On the Intersection of Context-Free and Regular Languages Clemente Pasti Andreas Opedal Tiago Pimentel Tim Vieira Jason Eisner Ryan Cotterell Wed 24 May 2023
- Singly Exponential Translation of Alternating Weak Buchi Automata to Unambiguous Buchi Automata Yong Li Sven Schewe Moshe Y. Vardi Wed 24 May 2023
- Separating Automatic Relations Pablo Barceló Diego Figueira Rémi Morvan Tue 16 May 2023
- Developments in Higher-Dimensional Automata Theory Amazigh Amrane Hugo Bazille Uli Fahrenberg Krzysztof Ziemiański Sun 07 May 2023
- Separability and Non-Determinizability of WSTS Eren Keskin Roland Meyer Sun 07 May 2023
- Geometry of Reachability sets of Vector Addition Systems Roland Guttenberg Mikhail Raskin Javier Esparza Fri 05 May 2023
- Decidable (Ac)counting with Parikh and Muller: Adding Presburger Arithmetic to Monadic Second-Order Logic over Tree-Interpretable Structures Luisa Herrmann Sebastian Rudolph Fri 05 May 2023
- History-deterministic Vector Addition Systems Sougata Bose David Purser Patrick Totzke Fri 05 May 2023
- Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality Marvin Kunnemann Filip Mazowiecki Lia Schutze Henry Sinclair-Banks Karol Węgrzycki Fri 05 May 2023
- Improved Complexity Analysis of Quasi-Polynomial Algorithms Solving Parity Games Paweł Parys Aleksander Wiącek Fri 05 May 2023
- Positive Data Languages Florian Frank Stefan Milius Henning Urbat Sat 29 April 2023
- Quantifying over Trees in Monadic Second-Order Logic Massimo Benerecetti Laura Bozzelli Fabio Mogavero Adriano Peron Fri 28 April 2023
- Multiplicity Problems on Algebraic Series and Context-Free Grammars Nikhil Balaji Lorenzo Clemente Klara Nosan Mahsa Shirmohammadi James Worrell Fri 28 April 2023
- Computing the linear hull: Deciding Sequential and Unambiguous for weighted automata over fields Jason P. Bell Daniel Smertnig Fri 28 April 2023
- The Krohn-Rhodes Logics Alessandro Ronca Fri 28 April 2023
- Quantitative estimates for the size of an intersection of sparse automatic sets Seda Albayrak Jason Bell Fri 28 April 2023
- On Certificates, Expected Runtimes, and Termination in Probabilistic Pushdown Automata Tobias Winkler Joost-Pieter Katoen Fri 28 April 2023
- Verifying linear temporal specifications of constant-rate multi-mode systems Michael Blondin Philip Offtermatt Alex Sansfaçon-Buchanan Fri 28 April 2023
- Revisiting Membership Problems in Subclasses of Rational Relations Pascal Bergstraßer Moses Ganardi Fri 28 April 2023
- Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata Mikołaj Bojańczyk Joanna Fijalkow Bartek Klin Joshua Moerman Tue 18 April 2023
- Transduction of Automatic Sequences and Applications Jeffrey Shallit Anatoly Zavyalov Mon 17 April 2023
- The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete) Laure Daviaud David Purser Mon 17 April 2023
- Reasoning about Regular Properties: A Comparative Study Tomáš Fiedor Lukáš Holík Martin Hruška Adam Rogalewicz Juraj Síč Pavol Vargovčík Mon 17 April 2023
- Markov Chains and Unambiguous Automata Christel Baier Stefan Kiefer Joachim Klein David Muller James Worrell Mon 17 April 2023
- Jumping Automata over Infinite Words Shaull Almagor Omer Yizhaq Thu 06 April 2023
- Model-Checking Branching-Time Properties of Stateless Probabilistic Pushdown Systems and Related Expansion Tianrong Lin Thu 30 March 2023
- A Coalgebraic Approach to Reducing Finitary Automata Keri D'Angelo Alexandra Silva Tue 28 March 2023
- Bideterministic Weighted Automata Peter Kostolányi Fri 24 March 2023
- Reachability in Injective Piecewise Affine Maps Faraz Ghahremani Edon Kelmendi Joel Ouaknine Fri 24 March 2023
- On the Power of Finite Ambiguity in Buchi Complementation Weizhi Feng Yong Li Andrea Turrini Moshe Y. Vardi Lijun Zhang Wed 08 March 2023
- The mathsfAC^0-Complexity Of Visibly Pushdown Languages Stefan Gøller Nathan Grosshans Thu 02 March 2023
- Regular Separability in Buchi VASS Pascal Baumann Roland Meyer Georg Zetzsche Thu 02 March 2023
- An algebraic approach to vectorial programs Charles Paperman Sylvain Salvati Claire Soyez-Martin Thu 02 March 2023
- Asynchronous Multiparty Session Type Implementability is Decidable -- Lessons Learned from Message Sequence Charts Felix Stutz Mon 27 February 2023
- Weighted Tree Automata with Constraints Andreas Maletti Andreea-Teodora Nász Mon 20 February 2023
- Buchi-like characterizations for Parikh-recognizable omega-languages Mario Grobler Sebastian Siebertz Mon 20 February 2023
- Languages With Decidable Learning: A Meta-Theorem Paul Krogmeier P. Madhusudan Mon 20 February 2023
- Languages given by Finite Automata over the Unary Alphabet Gordon Hoi Sanjay Jain Frank Stephan Christopher Tan Mon 20 February 2023
- Deterministic regular functions of infinite words Olivier Carton Gaetan Douéneau-Tabot Emmanuel Filiot Sarah Winter Mon 20 February 2023
- Coverability in 2-VASS with One Unary Counter is in NP Filip Mazowiecki Henry Sinclair-Banks Karol Węgrzycki Thu 09 February 2023
- Rudin-Shapiro Sums Via Automata Theory and Logic Narad Rampersad Jeffrey Shallit Tue 07 February 2023
- Descriptional Complexity of Finite Automata -- Selected Highlights Arto Salomaa Kai Salomaa Taylor J. Smith Tue 07 February 2023
- Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration Tobias Winkler Joost-Pieter Katoen Fri 27 January 2023
- Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs Patricia Bouyer Mickael Randour Pierre Vandenhove Fri 20 January 2023
- Folding interpretations Mikołaj Bojańczyk Tue 17 January 2023
- Modular Mix-and-Match Complementation of Buchi Automata (Technical Report) Vojtěch Havlena Ondřej Lengál Yong Li Barbora Šmahlíková Andrea Turrini Wed 11 January 2023
- A Perfect Model for Bounded Verification Javier Esparza Pierre Ganty Rupak Majumdar Wed 11 January 2023
- Automata and one-dimensional TQFTs with defects Paul Gustafson Mee Seong Im Remy Kaldawy Mikhail Khovanov Zachary Lihn Sat 07 January 2023
- Counterexamples to a Conjecture of Dombi in Additive Number Theory Jason P. Bell Jeffrey Shallit Sat 07 January 2023
- On the growth rate of polyregular functions Mikołaj Bojańczyk Thu 29 December 2022
- Completeness and the Finite Model Property for Kleene Algebra, Reconsidered Tobias Kappé Thu 29 December 2022
- Playing Safe, Ten Years Later Thomas Colcombet Nathanael Fijalkow Florian Horn Thu 29 December 2022
- Automata and automatic sequences Jean-Paul Allouche Michel Mendès France Sat 24 December 2022
- Parsing as a lifting problem and the Chomsky-Schutzenberger representation theorem Paul-André Melliès Noam Zeilberger Sat 24 December 2022
- Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs Olga Martynova Wed 07 December 2022
- P(ExpressionGrammar): Probability of deriving an algebraic expression with a probabilistic context-free grammar Urh Primozič Ljupčo Todorovski Matej Petković Mon 05 December 2022
- A Regular and Complete Notion of Delay for Streaming String Transducers Emmanuel Filiot Ismael Jecker Christof Løding Sarah Winter Fri 28 October 2022
- Alternating Good-for-MDP Automata Ernst Moritz Hahn Mateo Perez Sven Schewe Fabio Somenzi Ashutosh Trivedi Dominik Wojtczak Fri 28 October 2022
- Timed Games with Bounded Window Parity Objectives James C. A. Main Mickael Randour Jeremy Sproston Fri 28 October 2022
- Probabilistic Automata of Bounded Ambiguity Nathanael Fijalkow Cristian Riveros James Worrell Fri 28 October 2022
- On History-Deterministic One-Counter Nets Aditya Prakash K. S. Thejaswini Tue 25 October 2022
- How to Play Optimally for Regular Objectives Patricia Bouyer Nathanael Fijalkow Mickael Randour Pierre Vandenhove Tue 25 October 2022
- Some Tribonacci Conjectures Jeffrey Shallit Mon 17 October 2022
- Hiding pebbles when the output alphabet is unary Gaetan Douéneau-Tabot Sun 09 October 2022
- A generic polynomial time approach to separation by first-order logic without quantifier alternation Thomas Place Marc Zeitoun Sun 09 October 2022
- Pushdown Automata and Context-Free Grammars in Bisimulation Semantics Jos C. M. Baeten Cesare Carissimo Bas Luttik Sun 09 October 2022
- On Rational Recursive Sequences Lorenzo Clemente Maria Donten-Bury Filip Mazowiecki Michał Pilipczuk Sun 09 October 2022
- Pebble minimization: the last theorems Gaetan Douéneau-Tabot Sun 09 October 2022
- Non-closure under complementation for unambiguous linear grammars Olga Martynova Alexander Okhotin Sun 09 October 2022
- Cost Automata, Safe Schemes, and Downward Closures David Barozzini Lorenzo Clemente Thomas Colcombet Paweł Parys Mon 03 October 2022
- Characterising memory in infinite games Antonio Casares Pierre Ohlmann Mon 03 October 2022
- Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete (Crystallization: Near-Collapsing Process Graph Interpretations of Regular Expressions) Clemens Grabmayer Mon 03 October 2022
- Enumerating Regular Languages in Constant Delay Antoine Amarilli Mikael Monet Mon 03 October 2022
- Grammars over the Lambek Calculus with Permutation: Recognizing Power and Connection to Branching Vector Addition Systems with States Tikhon Pshenitsyn Fri 23 September 2022
- Polynomial Identification of omega-Automata Dana Angluin Dana Fisman Yaara Shoval Fri 23 September 2022
- A Hierarchy of Nondeterminism Bader Abu Radi Orna Kupferman Ofer Leshkowitz Fri 23 September 2022
- From LTL to rLTL Monitoring: Improved Monitorability through Robust Semantics Corto Mascle Daniel Neider Maximilian Schwenger Paulo Tabuada Alexander Weinert Martin Zimmermann Fri 16 September 2022
- Long Runs Imply Big Separators in Vector Addition Systems Wojciech Czerwiński Adam Jędrych Fri 16 September 2022
- Model Checking Temporal Properties of Recursive Probabilistic Programs Tobias Winkler Christina Gehnen Joost-Pieter Katoen Fri 16 September 2022
- Composing Copyless Streaming String Transducers Rajeev Alur Taylor Dohmen Ashutosh Trivedi Fri 16 September 2022
- How to decide Functionality of Compositions of Top-Down Tree Transducers Sebastian Maneth Helmut Seidl Martin Vu Wed 07 September 2022
- Universal Algorithms for Parity Games and Nested Fixpoints Marcin Jurdziński Rémi Morvan K. S. Thejaswini Tue 30 August 2022
- Morphisms and minimisation of weighted automata Sylvain Lombardy Jacques Sakarovitch Tue 30 August 2022
- Synthesis of Parametric Hybrid Automata from Time Series Miriam García Soto Thomas A. Henzinger Christian Schilling Mon 29 August 2022
- Walking on Words Ian Pratt-Hartmann Mon 29 August 2022
- The Regular Languages of First-Order Logic with One Alternation Corentin Barloy Michael Cadilhac Charles Paperman Thomas Zeume Mon 29 August 2022
- All about unambiguous polynomial closure Thomas Place Marc Zeitoun Thu 18 August 2022
- Active Learning for Deterministic Bottom-up Nominal Tree Automata R. Nakanishi Y. Takata H. Seki Thu 18 August 2022
- FORQ-based Language Inclusion Formal Testing Kyveli Doveri Pierre Ganty Nicolas Mazzocchi Mon 01 August 2022
- Natural Colors of Infinite Words Rudiger Ehlers Sven Schewe Tue 26 July 2022
- Z-polyregular functions Thomas Colcombet Gaetan Douéneau-Tabot Aliaume Lopez Thu 21 July 2022
- Parikh Automata over Infinite Words Shibashis Guha Ismael Jecker Karoliina Lehtinen Martin Zimmermann Thu 21 July 2022
- Simulations for Event-Clock Automata S Akshay Paul Gastin R Govind B Srivathsan Sat 16 July 2022
- Regular Monoidal Languages Matthew Earnshaw Paweł Sobociński Wed 13 July 2022
- Divide-and-Conquer Determinization of Buchi Automata based on SCC Decomposition Yong Li Andrea Turrini Weizhi Feng Moshe Y. Vardi Lijun Zhang Fri 01 July 2022
- Monitoring Timed Properties (Revisited) Thomas Møller Grosen Sean Kauffman Kim Guldstrand Larsen Martin Zimmermann Fri 01 July 2022
- Decision Questions for Probabilistic Automata on Small Alphabets Paul C. Bell Pavel Semukhin Wed 29 June 2022
- Towards an AAK Theory Approach to Approximate Minimization in the Multi-Letter Case Clara Lacroce Prakash Panangaden Guillaume Rabusseau Thu 02 June 2022
- The boundedness and zero isolation problems for weighted automata over nonnegative rationals Wojciech Czerwiński Engel Lefaucheux Filip Mazowiecki David Purser Markus A. Whiteland Tue 31 May 2022
- Synchronizable functions on integers Didier Caucal Chloé Rispal Tue 31 May 2022
- Register Set Automata (Technical Report) Sabína Gulčíková Ondřej Lengál Thu 26 May 2022
- A Generic Solution to Register-bounded Synthesis with an Application to Discrete Orders Léo Exibard Emmanuel Filiot Ayrat Khalimov Thu 26 May 2022
- On eventual non-negativity and positivity for the weighted sum of powers of matrices S Akshay Supratik Chakraborty Debtanu Pal Thu 26 May 2022
- Simulations of Weighted Tree Automata Zoltán Ésik Andreas Maletti Fri 20 May 2022
- Automata Learning: An Algebraic Approach Henning Urbat Lutz Schrøder Fri 20 May 2022
- A Generic Solution to Register-bounded Synthesis with an Application to Discrete Orders Léo Exibard Emmanuel Filiot Ayrat Khalimov Thu 12 May 2022
- Group separation strikes back Thomas Place Marc Zeitoun Tue 10 May 2022
- Half-Positional Objectives Recognized by Deterministic Buchi Automata Patricia Bouyer Antonio Casares Mickael Randour Pierre Vandenhove Tue 10 May 2022
- Unboundedness for Recursion Schemes: A Simpler Type System David Barozzini Paweł Parys Jan Wróblewski Wed 27 April 2022
- Parameterized safety verification of round-based shared-memory systems Nathalie Bertrand Nicolas Markey Ocan Sankur Nicolas Waldburger Wed 27 April 2022
- Reachability in Bidirected Pushdown VASS Moses Ganardi Rupak Majumdar Andreas Pavlogiannis Lia Schutze Georg Zetzsche Wed 27 April 2022
- On the size of good-for-games Rabin automata and its link with the memory in Muller games Antonio Casares Thomas Colcombet Karoliina Lehtinen Wed 27 April 2022
- Continuous rational functions are deterministic regular Olivier Carton Gaetan Douéneau-Tabot Wed 27 April 2022
- Pebble transducers with unary output Gaetan Douéneau-Tabot Wed 27 April 2022
- Ambiguity through the lens of measure theory Olivier Carton Wed 27 April 2022
- The Regular Languages of First-Order Logic with One Alternation Corentin Barloy Michael Cadilhac Charles Paperman Thomas Zeume Mon 14 March 2022
- Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes Wojciech Czerwiński Łukasz Orlikowski Sat 12 March 2022
- Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable Wojciech Czerwiński Piotr Hofman Thu 17 February 2022
- A Note on the Relation between Recognisable Series and Regular Sequences, and their Minimal Linear Representations Clemens Heuberger Daniel Krenn Gabriel F. Lipnik Fri 04 February 2022
- Approximate NFA Universality and Related Problems Motivated by Information Theory Stavros Konstantinidis Mitja Mastnak Nelma Moreira Rogério Reis Fri 04 February 2022
- Supported Sets -- A New Foundation For Nominal Sets And Automata Thorsten Wißmann Tue 01 February 2022
- Languages of Higher-Dimensional Automata Uli Fahrenberg Christian Johansen Georg Struth Krzysztof Ziemiański Mon 29 November 2021
- History Determinism vs. Good for Gameness in Quantitative Automata Udi Boker Karoliina Lehtinen Wed 03 November 2021
- A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings Gustav Grabolle Wed 22 September 2021
- Lower Bounds on Unambiguous Automata Complementation and Separation via Communication Complexity Mika Gøøs Stefan Kiefer Wed 22 September 2021
- Reducing Higher-order Recursion Scheme Equivalence to Coinductive Higher-order Constrained Horn Clauses Jerome Jochems Mon 13 September 2021
- Linear equations for unordered data vectors Piotr Hofman Jakub Różycki Wed 08 September 2021
- Logics Meet 2-Way 1-Clock Alternating Timed Automata Shankara Narayanan Krishna Khushraj Nanik Madnani Manuel Jr. Mazo Paritosh K. Pandya Wed 08 September 2021
- Image-Binary Automata Stefan Kiefer Cas Widdershoven Fri 03 September 2021
- From Regular to Strictly Locally Testable Languages Stefano Crespi Reghizzi Pierluigi San Pietro Fri 27 August 2021
- Decentralized Observation of Discrete-Event Systems: At Least One Can Tell Stavros Tripakis Karen Rudie Mon 16 August 2021
- Decidable Verification of Uninterpreted Programs Umang Mathur P. Madhusudan Mahesh Viswanathan Mon 02 August 2021
- Logical Characterization of Coherent Uninterpreted Programs Hari Govind V K Sharon Shoham Arie Gurfinkel Mon 02 August 2021
- Minimization of visibly pushdown automata is NP-complete Olivier Gauwin Anca Muscholl Michael Raskin Tue 27 July 2021
- Certifying DFA Bounds for Recognition and Separation Orna Kupferman Nir Lavee Salomon Sickert Tue 06 July 2021
- Certifying Inexpressibility Orna Kupferman Salomon Sickert Tue 06 July 2021
- Transducer Synthesis from Universal Register Automata in (N,>) Ayrat Khalimov Emmanuel Filiot Léo Exibard Mon 24 May 2021
- Comparison-free polyregular functions Lê Thành Dung Nguy~ên Camille Noûs Pierre Pradic Wed 19 May 2021
- Improved Ackermannian lower bound for the VASS reachability problem Sławomir Lasota Wed 19 May 2021
- On Complementing Unambiguous Automata and Graphs With Many Cliques and Cocliques Emil Indzhev Stefan Kiefer Tue 18 May 2021
- A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct Shibashis Guha Ismael Jecker Karoliina Lehtinen Martin Zimmermann Fri 07 May 2021
- Higher-Order Model Checking Step by Step Paweł Parys Thu 06 May 2021
- Reachability Switching Games John Fearnley Martin Gairing Matthias Mnich Rahul Savani Fri 30 April 2021
- Reachability in Vector Addition Systems is Ackermann-complete Wojciech Czerwiński Łukasz Orlikowski Thu 29 April 2021
- Multi-weighted Automata and MSO Logic Manfred Droste Vitaly Perevoshchikov Thu 29 April 2021
- Parikh's theorem for infinite alphabets Piotr Hofman Marta Juzepczuk Sławomir Lasota Mohnish Pattathurajan Tue 27 April 2021
- Congruence Relations for Buchi Automata Yong Li Yih-Kuen Tsay Moshe Y. Vardi Mon 26 April 2021
- Determinisability of register and timed automata Lorenzo Clemente Sławomir Lasota Radosław Piórkowski Fri 09 April 2021
- Synthesis of Data Word Transducers Léo Exibard Emmanuel Filiot Pierre-Alain Reynier Wed 24 March 2021
- Converting Nondeterministic Two-Way Automata into Small Deterministic Linear-Time Machines Bruno Guillon Giovanni Pighizzini Luca Prigioniero Daniel Průša Wed 10 March 2021
- On synthesizing Skolem functions for first order logic formulae S. Akshay Supratik Chakraborty Mon 22 February 2021
- On polynomial grammars extended with substitution Janusz Schmude Thu 18 February 2021
- New Techniques for Universality in Unambiguous Register Automata Wojciech Czerwiński Antoine Mottet Karin Quaas Wed 17 February 2021
- Synchronizing Strongly Connected Partial DFAs Mikhail V. Berlinkov Robert Ferens Andrew Ryzhikov Marek Szykuła Sun 14 February 2021
- Solving one variable word equations in the free group in cubic time Robert Ferens Artur Jeż Sun 14 February 2021
- A Ramsey Theorem for Finite Monoids Ismael Jecker Sun 14 February 2021
- Determinising Parity Automata Sven Schewe Thomas Varghese Mon 01 February 2021
- Leafy Automata for Higher-Order Concurrency Alex Dixon Ranko Lazić Andrzej S. Murawski Igor Walukiewicz Fri 22 January 2021
- General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond Rupak Majumdar Ramanathan S. Thinniyam Georg Zetzsche Fri 22 January 2021
- Nondeterministic Syntactic Complexity Robert Myers Stefan Milius Henning Urbat Thu 21 January 2021
- Register Automata with Extrema Constraints, and an Application to Two-Variable Logic Szymon Toruńczyk Thomas Zeume Thu 21 January 2021
- SD-Regular Transducer Expressions for Aperiodic Transformations Luc Dartois Paul Gastin Shankara Narayanan Krishna Thu 21 January 2021
- Computability of Data-Word Transductions over Different Data Domains Léo Exibard Emmanuel Filiot Nathan Lhote Pierre-Alain Reynier Thu 21 January 2021
- Reiterman's Theorem on Finite Algebras for a Monad Jiri Adamek Liang-Ting Chen Stefan Milius Henning Urbat Wed 13 January 2021
- Transience in Countable MDPs Stefan Kiefer Richard Mayr Mahsa Shirmohammadi Patrick Totzke Tue 05 January 2021
- Bidimensional linear recursive sequences and universality of unambiguous register automata Corentin Barloy Lorenzo Clemente Tue 05 January 2021
- Reachability relations of timed pushdown automata Lorenzo Clemente Sławomir Lasota Fri 01 January 2021
- On probabilistic stable event structures Nargess Ghahremani Julian Bradfield Sun 27 December 2020
- On is an n-MCFL Kilian Gebhardt Frédéric Meunier Sylvain Salvati Sun 27 December 2020
- Describing the syntax of programming languages using conjunctive and Boolean grammars Alexander Okhotin Sun 13 December 2020
- Optimal transformations of Muller conditions Antonio Casares Thomas Colcombet Nathanael Fijalkow Sun 13 December 2020
- Learning of Structurally Unambiguous Probabilistic Grammars Dolav Nitay Dana Fisman Michal Ziv-Ukelson Mon 23 November 2020
- Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete Stefan Gøller Mathieu Hilaire Mon 23 November 2020
- Weighted automata are compact and actively learnable Artem Kaznatcheev Prakash Panangaden Mon 23 November 2020
- Minimisation of Multiplicity Tree Automata Stefan Kiefer Ines Marusic James Worrell Sat 21 November 2020
- Context-Bounded Verification of Liveness Properties for Multithreaded Shared-Memory Programs Pascal Baumann Rupak Majumdar Ramanathan S. Thinniyam Georg Zetzsche Thu 12 November 2020
- The algebra of binary trees is affine complete Andre Arnold Patrick Cegielski Serge Grigorieff Irene Guessarian Thu 12 November 2020
- On Krohn-Rhodes theory for semiautomata Karl-Heinz Zimmermann Wed 04 November 2020
- Deciding ømega-Regular Properties on Linear Recurrence Sequences Shaull Almagor Toghrul Karimov Edon Kelmendi Jøel Ouaknine James Worrell Fri 30 October 2020
- Bases for algebras over a monad Stefan Zetzsche Alexandra Silva Matteo Sammartino Sun 25 October 2020
- Harnessing LTL With Freeze Quantification Daniel Hausmann Stefan Milius Lutz Schrøder Sun 25 October 2020
- Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture Jeffrey Shallit Sun 25 October 2020
- Approximating the Minimal Lookahead Needed to Win Infinite Games Martin Zimmermann Sun 25 October 2020
- Completeness of Kozen's Axiomatization for the Modal mu-Calculus: A Simple Proof Kuniaki Tamura Tue 20 October 2020
- Word equations in linear space Artur Jeż Mon 19 October 2020
- Tree Automata and Tree Grammars Joost Engelfriet Fri 16 October 2020
- A succinct canonical register automaton model Sofia Cassel Falk Howar Bengt Jonsson Maik Merten Bernhard Steffen Fri 16 October 2020
- Reachability for Updatable Timed Automata made faster and more effective Paul Gastin Sayan Mukherjee B Srivathsan Wed 07 October 2020
- Higher-Order Nonemptiness Step by Step Paweł Parys Fri 18 September 2020
- Notes on Equivalence and Minimization of Weighted Automata Stefan Kiefer Thu 03 September 2020
- Regular Cost Functions, Part I: Logic and Algebra over Words Thomas Colcombet Wed 19 August 2020
- Implicit automata in typed łambda-calculi II: streaming transducers vs categorical semantics Nguyên Thành Dũng Lê Camille Noûs Pierre Pradic Tue 04 August 2020
- On the Expressive Power of Higher-Order Pushdown Systems Paweł Parys Tue 04 August 2020
- Separation Property for wB- and wS-regular Languages Michał Skrzypczak Tue 04 August 2020
- Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility Anthony W. Lin Rupak Majumdar Fri 31 July 2020
- A New Upper Bound for Separating Words Zachary Chase Sat 25 July 2020
- Universality Problem for Unambiguous VASS Wojciech Czerwiński Diego Figueira Piotr Hofman Thu 23 July 2020
- Reachability in Two-Dimensional Vector Addition Systems with States: One Test is for Free Jérôme Leroux Grégoire Sutre Tue 21 July 2020
- Multi-dimensional Long-Run Average Problems for Vector Addition Systems with States Krishnendu Chatterjee Thomas A. Henzinger Jan Otop Tue 21 July 2020
- Greibach Normal Form for ømega-Algebraic Systems and Weighted Simple ømega-Pushdown Automata Manfred Droste Sven Dziadek Werner Kuich Tue 21 July 2020
- Determinisability of one-clock timed automata Lorenzo Clemente Sławomir Lasota Radosław Piórkowski Tue 21 July 2020
- The Big-O Problem for Labelled Markov Chains and Weighted Automata Dmitry Chistikov Stefan Kiefer Andrzej S. Murawski David Purser Sat 18 July 2020
- Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces (extended version) Bharat Adsul Paul Gastin Saptarshi Sarkar Pascal Weil Sat 18 July 2020
- On flat lossy channel machines Philippe Schnoebelen Tue 14 July 2020
- Certifying Emptiness of Timed Buchi Automata Simon Wimmer Frédéric Herbreteau Jaco van de Pol Thu 09 July 2020
- Typed lambda-calculi and superclasses of regular functions Lê Thành Dung Nguy~ên Wed 08 July 2020
- The Complexity of Flat Freeze LTL Benedikt Bollig Karin Quaas Arnaud Sangnier Wed 08 July 2020
- Active learning of timed automata with unobservable resets Léo Henry Nicolas Markey Thierry Jéron Mon 06 July 2020
- Re-Pairing Brackets Dmitry Chistikov Mikhail Vyalyi Sat 04 July 2020
- A Quasiorder-based Perspective on Residual Automata Pierre Ganty Elena Gutiérrez Pedro Valero Sat 04 July 2020
- An Approach to Regular Separability in Vector Addition Systems Wojciech Czerwiński Georg Zetzsche Sat 04 July 2020
- Detectability of labeled weighted (max-plus) automata Kuize Zhang Fri 26 June 2020
- Rational subsets of Baumslag-Solitar groups Michael Cadilhac Dmitry Chistikov Georg Zetzsche Tue 23 June 2020
- Algebraic Language Theory for Eilenberg--Moore Algebras Achim Blumensath Mon 22 June 2020
- On the complexity of the universality and inclusion problems for unambiguous context-free grammars (Invited Paper) Lorenzo Clemente Thu 11 June 2020
- Preservation of normality by unambiguous transducers Olivier Carton Tue 02 June 2020
- Testing Membership for Timed Automata Richard Lassaigne Michel de Rougemont Fri 29 May 2020
- On the Power of Unambiguity in Buchi Complementation Yong Li Moshe Y. Vardi Lijun Zhang Wed 20 May 2020
- On the Separability Problem of String Constraints Parosh Aziz Abdulla Mohamed Faouzi Atig Vruda Dave Shankara Narayanan Krishna Wed 20 May 2020
- Qualitative Controller Synthesis for Consumption Markov Decision Processes František Blahoudek Tomáš Brázdil Petr Novotný Melkior Ornik Pranay Thangeda Ufuk Topcu Tue 19 May 2020
- The Extended HOA Format for Synthesis Guillermo A. Perez Thu 14 May 2020
- Bisimilarity in fresh-register automata Andrzej S. Murawski Steven J. Ramsay Nikos Tzevelekos Thu 14 May 2020
- Bisimulation Finiteness of Pushdown Systems Is Elementary Stefan Gøller Paweł Parys Thu 14 May 2020
- Computing the Width of Non-deterministic Automata Denis Kuperberg Anirban Majumdar Wed 13 May 2020
- On Succinctness and Recognisability of Alternating Good-for-Games Automata Udi Boker Denis Kuperberg Karoliina Lehtinen Michał Skrzypczak Wed 13 May 2020
- Synchronization of Deterministic Visibly Push-Down Automata Henning Fernau Petra Wolf Wed 13 May 2020
- Regular matching problems for infinite trees Carlos Camino Volker Diekert Besik Dundua Mircea Marin Géraud Sénizergues Wed 13 May 2020
- Synchronizing Deterministic Push-Down Automata Can Be Really Hard Henning Fernau Petra Wolf Tomoyuki Yamakami Wed 13 May 2020
- Regular resynchronizability of origin transducers is undecidable Denis Kuperberg Jan Martens Wed 13 May 2020
- What You Must Remember When Transforming Datawords M. Praveen Wed 13 May 2020
- Games Where You Can Play Optimally with Arena-Independent Finite Memory Patricia Bouyer Stéphane Le Roux Youssouf Oualhadj Mickael Randour Pierre Vandenhove Wed 13 May 2020
- Parametrized Universality Problems for One-Counter Nets Shaull Almagor Udi Boker Piotr Hofman Patrick Totzke Wed 13 May 2020
- Revisiting Synthesis for One-Counter Automata Guillermo A. Pérez Ritam Raha Wed 06 May 2020
- Regular Model Checking Revisited (Technical Report) Anthony W. Lin Philipp Rummer Wed 06 May 2020
- Automata Tutor v3 Loris D'Antoni Martin Helfrich Jan Emanuel Kretinsky Ramneantu Maximilian Weininger Wed 06 May 2020
- Register transducers are marble transducers Gaetan Douéneau-Tabot Emmanuel Filiot Paul Gastin Wed 06 May 2020
- An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata Salomon Sickert Javier Esparza Tue 05 May 2020
- Register Games on Infinite Ordered Data Domains Léo Exibard Emmanuel Filiot Ayrat Khalimov Sat 02 May 2020
- Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes Raphael Berthon Shibashis Guha Jean-François Raskin Thu 30 April 2020
- Timed games and deterministic separability Lorenzo Clemente Sławomir Lasota Radosław Piórkowski Tue 28 April 2020
- On the Size of Finite Rational Matrix Semigroups Georgina Bumpus Christoph Haase Stefan Kiefer Paul-Ioan Stoienescu Jonathan Tanner Sun 19 April 2020
- Minimising Good-for-Games automata is NP complete Sven Schewe Sun 29 March 2020
- The Strahler number of a parity game Laure Daviaud Marcin Jurdziński K. S. Thejaswini Sat 21 March 2020
- Equivalence of Linear Tree Transducers with Output in the Free Group Raphaela Løbel Michael Luttenberger Helmut Seidl Sat 21 March 2020
- How Good Is a Strategy in a Game With Nature Arnaud Carayol Olivier Serre Tue 03 March 2020
- On Computability of Data Word Functions Defined by Transducers Léo Exibard Emmanuel Filiot Pierre-Alain Reynier Tue 03 March 2020
- Multiplicity Equivalence Testing of Automata over Partially Commutative Monoids V. Arvind Abhranil Chatterjee Rajit Datta Partha Mukhopadhyay Tue 03 March 2020
- Extensions of ømega-Regular Languages Mikołaj Bojańczyk Edon Kelmendi Rafał Stefański Georg Zetzsche Tue 03 March 2020
- First-order tree-to-tree functions Mikołaj Bojańczyk Amina Doumane Tue 03 March 2020
- On polynomial recursive sequences Michael Cadilhac Filip Mazowiecki Charles Paperman Michał Pilipczuk Géraud Sénizergues Sun 01 March 2020
- The monitoring problem for timed automata Alejandro Grez Filip Mazowiecki Michał Pilipczuk Gabriele Puppis Cristian Riveros Fri 21 February 2020
- A Survey on String Constraint Solving Roberto Amadini Thu 13 February 2020
- Buchi automata recognizing sets of reals definable in first-order logic with addition and order Arthur Milchior Wed 12 February 2020
- Alternating Tree Automata with Qualitative Semantics Raphael Berthon Nathanael Fijalkow Emmanuel Filiot Shibashis Guha Bastien Maubert Aniello Murano Laureline Pinault Sophie Pinchinat Sasha Rubin Olivier Serre Wed 12 February 2020
- Polynomial time algorithms for inclusion and equivalence of deterministic parity acceptors Dana Angluin Dana Fisman Wed 12 February 2020
- Complete Abstractions for Checking Language Inclusion Pierre Ganty Francesco Ranzato Pedro Valero Tue 11 February 2020
- The Uniform Measure of Simple Regular Sets of Infinite Trees Marcin Przybyłko Michał Skrzypczak Mon 03 February 2020
- On Affine Reachability Problems Stefan Jaax Stefan Kiefer Thu 30 January 2020
- Decisiveness of Stochastic Systems and its Application to Hybrid Models Patricia Bouyer Thomas Brihaye Mickael Randour Cédric Rivière Pierre Vandenhove Tue 14 January 2020
- One-Clock Priced Timed Games are PSPACE-hard John Fearnley Rasmus Ibsen-Jensen Rahul Savani Tue 14 January 2020
- Good-for-games ømega-Pushdown Automata Karoliina Lehtinen Martin Zimmermann Tue 14 January 2020
- Reachability in fixed dimension vector addition systems with states Wojciech Czerwiński Sławomir Lasota Ranko Lazić Jérôme Leroux Filip Mazowiecki Tue 14 January 2020
- Lower bounds for the state complexity of probabilistic languages and the language of prime numbers Nathanael Fijalkow Fri 27 December 2019
- Life is Random, Time is Not: Markov Decision Processes with Window Objectives Thomas Brihaye Florent Delgrange Youssouf Oualhadj Mickael Randour Thu 12 December 2019
- A Survey on Theorem Provers in Formal Methods M. Saqib Nawaz Moin Malik Yi Li Meng Sun M. Ikram Ullah Lali Wed 11 December 2019
- Wreath Products of Distributive Forest Algebras Michael Hahn Andreas Krebs Howard Straubing Tue 12 November 2019
- A Btextbackslash''uchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage Joost Engelfriet Heiko Vogler Tue 12 November 2019
- New Optimizations and Heuristics for Determinization of Buchi Automata Christof Løding Anton Pirogov Wed 06 November 2019
- Controlling a random population Thomas Colcombet Nathanael Fijalkow Pierre Ohlmann Tue 05 November 2019
- MSO-Definable Regular Model Checking Vrunda Dave Taylor Dohmen Shankara Narayana Krishna Ashutosh Trivedi Tue 29 October 2019
- Residual Nominal Automata Joshua Moerman Matteo Sammartino Mon 28 October 2019
- A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra Mikołaj Bojańczyk Bartek Klin Fri 25 October 2019
- Learning One-Clock Timed Automata Jie An Mingshuai Chen Bohua Zhan Naijun Zhan Miaomiao Zhang Thu 24 October 2019
- Complexity Results on Register Pushdown Automata Ryoma Senda Yoshiaki Takata Hiroyuki Seki Thu 24 October 2019
- Logical and Algebraic Characterizations of Rational Transductions Emmanuel Filiot Olivier Gauwin Nathan Lhote Fri 18 October 2019
- Equivalence kernels of sequential functions and sequential observation synthesis Paulin Fournier Nathan Lhote Fri 18 October 2019
- CLS-SMT: Bringing Together Combinatory Logic Synthesis and Satisfiability Modulo Theories Fadil Kallat Tristan Schafer Anna Vasileva Mon 14 October 2019
- Reachability Analysis of Self Modifying Code Tayssir Touili Xin Ye Mon 14 October 2019
- Existential length universality Paweł Gawrychowski Martin Lange Narad Rampersad Jeffrey Shallit Marek Szykuła Fri 11 October 2019
- Parity Games: Another View on Lehtinen's Algorithm Paweł Parys Fri 11 October 2019
- The Well Structured Problem for Presburger Counter Machines Alain Finkel Ekanshdeep Gupta Tue 08 October 2019
- Unambiguous separators for tropical tree automata Thomas Colcombet Sylvain Lombardy Tue 08 October 2019
- Aperiodic Weighted Automata and Weighted First-Order Logic Manfred Droste Paul Gastin Tue 01 October 2019
- The Complexity of Reachability in Affine Vector Addition Systems with States Michael Blondin Mikhail Raskin Tue 10 September 2019
- Regular tree languages in low levels of the Wadge Hierarchy Mikołaj Bojańczyk Filippo Cavallari Thomas Place Michał Skrzypczak Tue 10 September 2019
- On the k-synchronizability for mailbox systems Cinzia Di Giusto Laetitia Laversa Etienne Lozes Thu 05 September 2019
- Regular Tree Algebras Achim Blumensath Tue 20 August 2019
- Shortest paths in one-counter systems Dmitry Chistikov Wojciech Czerwiński Piotr Hofman Michał Pilipczuk Michael Wehar Sun 18 August 2019
- Parikh Images of Regular Languages: Complexity and Applications Anthony Widjaja To Fri 16 August 2019
- Regular Separability and Intersection Emptiness are Independent Problems Ramanathan S. Thinniyam Georg Zetzsche Wed 14 August 2019
- A Robust Class of Linear Recurrence Sequences Corentin Barloy Nathanael Fijalkow Nathan Lhote Filip Mazowiecki Wed 14 August 2019
- Families of DFAs as Acceptors of ømega-Regular Languages Dana Angluin Udi Boker Dana Fisman Fri 09 August 2019
- Recompression: a simple and powerful technique for word equations Artur Jeż Thu 08 August 2019
- Continuity of Functional Transducers: A Profinite Study of Rational Functions Michael Cadilhac Olivier Carton Charles Paperman Wed 07 August 2019
- Modular Descriptions of Regular Functions Paul Gastin Tue 06 August 2019
- Single use register automata for data words Mikołaj Bojańczyk Rafał Stefański Thu 25 July 2019
- Minimization of visibly pushdown automata is NP-complete Olivier Gauwin Anca Muscholl Michael Raskin Wed 24 July 2019
- Two-way Parikh Automata Emmanuel Filiot Shibashis Guha Nicolas Mazzocchi Tue 23 July 2019
- Solving Mean-Payoff Games via Quasi Dominions Massimo Benerecetti Daniele Dell'Erba Fabio Mogavero Sat 20 July 2019
- From LTL to Unambiguous Btextbackslash''uchi Automata via Disambiguation of Alternating Automata Simon Jantsch David Muller Christel Baier Joachim Klein Tue 09 July 2019
- Revisiting local time semantics for networks of timed automata R. Govind Frédéric Herbreteau B. Srivathsan Igor Walukiewicz Tue 09 July 2019
- What's decidable about parametric timed automata Étienne André Tue 09 July 2019
- Computing Probabilistic Bisimilarity Distances for Probabilistic Automata Giorgio Bacci Giovanni Bacci Kim G. Larsen Radu Mardare Qiyi Tang Franck van Breugel Tue 09 July 2019
- Timed Basic Parallel Processes Lorenzo Clemente Piotr Hofman Patrick Totzke Wed 03 July 2019
- Good for Games Automata: From Nondeterminism to Alternation Udi Boker Karoliina Lehtinen Fri 28 June 2019
- A Congruence-based Perspective on Automata Minimization Algorithms Pierre Ganty Elena Gutiérrez Pedro Valero Fri 28 June 2019
- Regular Separability of One Counter Automata Wojciech Czerwiński Sławomir Lasota Fri 28 June 2019
- Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques Stefan Kiefer Cas Widdershoven Tue 25 June 2019
- Regular tree languages in low levels of the Wadge Hierarchy Mikołaj Bojańczyk Filippo Cavallari Thomas Place Michał Skrzypczak Tue 18 June 2019
- Action-Sensitive Phonological Dependencies Yiding Hao Dustin Bowers Tue 18 June 2019
- Coverability is Undecidable in One-dimensional Pushdown Vector Addition Systems with Resets Sylvain Schmitz Georg Zetzsche Tue 18 June 2019
- Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence Petr Jancar Wed 12 June 2019
- Reachability for Bounded Branching VASS Filip Mazowiecki Michał Pilipczuk Wed 12 June 2019
- Equivalence of finite-valued streaming string transducers is decidable Anca Muscholl Gabriele Puppis Fri 07 June 2019
- Separation and Renaming in Nominal Sets Joshua Moerman Jurriaan Rot Fri 07 June 2019
- On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases Bernard Boigelot Julien Brusten Veronique Bruyere Fri 31 May 2019
- Polyregular Functions Mikołaj Bojańczyk Fri 31 May 2019
- String-to-String Interpretations with Polynomial-Size Output Mikołaj Bojańczyk Sandra Kiefer Nathan Lhote Fri 31 May 2019
- On the Containment Problem for Unambiguous Single-Register Automata with Guessing Antoine Mottet Karin Quaas Thu 30 May 2019
- On counting functions and slenderness of languages Oscar H. Ibarra Ian McQuillan Bala Ravikumar Tue 28 May 2019
- Automata Terms in a Lazy WSkS Decision Procedure (Technical Report) Vojtěch Havlena Lukáš Holík Ondřej Lengál Tomáš Vojnar Tue 28 May 2019
- On Timed Scope-bounded Context-sensitive Languages Devendra. Bhave S. N. Krishna Ramchandra Phawade Ashutosh Trivedi Tue 28 May 2019
- Simulations in Rank-Based Buchi Automata Complementation Yu-Fang Chen Vojtěch Havlena Ondřej Lengál Mon 20 May 2019
- Long-Run Average Behavior of Vector Addition Systems with States Krishnendu Chatterjee Thomas A. Henzinger Jan Otop Wed 15 May 2019
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time Paweł Parys Fri 10 May 2019
- The height of piecewise-testable languages and the complexity of the logic of subwords Prateek Karandikar Philippe Schnoebelen Wed 08 May 2019
- Covering and separation for logical fragments with modular predicates Thomas Place Varun Ramanathan Pascal Weil Mon 06 May 2019
- Alternating Weak Automata from Universal Trees Laure Daviaud Marcin Jurdzinski Karoliina Lehtinen Tue 30 April 2019
- Fast algorithms for handling diagonal constraints in timed automata Paul Gastin Sayan Mukherjee B Srivathsan Tue 23 April 2019
- Parametric updates in parametric timed automata Étienne André Didier Lime Mathias Ramparison Tue 23 April 2019
- The complexity of mean payoff games using universal graphs Nathanael Fijalkow Paweł Gawrychowski Pierre Ohlmann Mon 18 March 2019
- Equivalence of pushdown automata via first-order grammars Petr Jancar Thu 14 March 2019
- Buchi Complementation and Size-Change Termination Seth Fogarty Moshe Y. Vardi Fri 08 March 2019
- A more reasonable proof of Cobham's theorem Thijmen J. P. Krebs Thu 07 March 2019
- Efficient reduction of nondeterministic automata with application to language inclusion testing Lorenzo Clemente Richard Mayr Thu 07 March 2019
- Decidability of Timed Communicating Automata Lorenzo Clemente Mon 04 March 2019
- Continuous Reachability for Unordered Data Petri nets is in PTime Utkarsh Gupta Preey Shah S. Akshay Piotr Hofman Sat 23 February 2019
- Automata theory in nominal sets Mikołaj Bojańczyk Bartek Klin Sławomir Lasota Wed 30 January 2019
- Model Checking Flat Freeze LTL on One-Counter Automata Antonia Lechner Richard Mayr Joel Ouaknine Amaury Pouly James Worrell Mon 21 January 2019
- Computing the Width of Non-deterministic Automata Denis Kuperberg Anirban Majumdar Fri 11 January 2019
- Intersection Types and Counting Paweł Parys Fri 11 January 2019
- Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata Vojtěch Forejt Petr Jančar Stefan Kiefer James Worrell Tue 20 November 2018
- Efficient reduction of nondeterministic automata with application to language inclusion testing L. Clemente R. Mayr Tue 20 November 2018
- Merge decompositions, two-sided Krohn-Rhodes, and aperiodic pointlikes S. J. v. Gool B. Steinberg Fri 16 November 2018
- The Krohn-Rhodes Theorem and Local Divisors V. Diekert M. Kufleitner B. Steinberg Fri 16 November 2018
- A Characterization for Decidable Separability by Piecewise Testable Languages Wojciech Czerwiński Wim Martens Lorijn van Rooijen Marc Zeitoun Georg Zetzsche Mon 12 November 2018
- Emptiness of Stack Automata is NEXPTIME-complete: A Correction C. Broadbent A. Carayol M. Hague O. Serre Mon 05 November 2018
- The Parikh Property for Weighted Context-Free Grammars P. Ganty E. Gutiérrez Wed 10 October 2018
- The ``Hilbert Method'' for Solving Transducer Equivalence Problems A. Boiret R. Piórkowski J. Schmude Wed 10 October 2018
- Gossiping in Message-Passing Systems B. Bollig M. Fortin P. Gastin Tue 09 October 2018
- On parametrized verification of asynchronous, shared-memory pushdown systems M. Fortin A. Muscholl I. Walukiewicz Tue 09 October 2018
- The Containment Problem for Unambiguous Register Automata A. Mottet K. Quaas Mon 01 October 2018
- Regular omega-Languages with an Informative Right Congruence Dana Angluin Dana Fisman Sat 15 September 2018
- Boundedness in languages of infinite words Mikołaj Bojańczyk Thomas Colcombet Wed 18 July 2018
- Star Height via Games M. Bojanczyk Wed 18 July 2018
- Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems M. Hague R. Meyer S. Muskalla M. Zimmermann Fri 06 July 2018
- Alternating Nonzero Automata P. Fournier H. Gimbert Thu 21 June 2018
- It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with ``Happened Before'' B. Bollig M. Fortin P. Gastin Thu 21 June 2018
- Synchronizing Data Words for Register Automata K. Quaas M. Shirmohammadi Tue 19 June 2018
- Model Checking Markov Chains Against Unambiguous Buchi Automata M. Benedikt R. Lenhardt J. Worrell Fri 15 June 2018
- A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton M. Raskin Fri 15 June 2018
- Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms L. Clemente S. Lasota Tue 01 May 2018
- Timed pushdown automata revisited L. Clemente S. Lasota Thu 26 April 2018
- Monadic Second Order Logic with Measure and Category Quantifiers Matteo Mio Michał Skrzypczak Henryk Michalewski Tue 10 April 2018
- Profile trees for Buchi word automata, with application to determinization Seth Fogarty Orna Kupferman Moshe Y. Vardi Thomas Wilke Thu 01 March 2018
- The Abstract Theory of Automata V M Glushkov Thu 26 February 2015
- Advanced automata minimization Richard Mayr Lorenzo Clemente Tue 26 February 2013
- The Logic of Automata Brian Gaines Ladislav Kohout Sat 29 December 2012
- The Logic of Automata---Part II Arthur W. Burks Hao Wang Sat 29 December 2012
- The Logic of Automata---Part I Arthur W. Burks Hao Wang Sat 29 December 2012
- Gedanken Experiments on Sequential Machines Edward F. Moore Sat 29 December 2012
- The reduction of two-way automata to one-way automata J. C. Shepherdson Fri 28 December 2012
- Representation of events in nerve nets and finite automata S. C. Kleene Mon 10 December 2012
- A logical calculus of the ideas immanent in nervous activity WarrenS. McCulloch Walter Pitts Mon 10 December 2012
- Theory of Logical Nets A.W. Burks J.B. Wright Mon 10 December 2012
- Some definitional suggestions for automata theory Dana Scott Mon 10 December 2012
- Decision methods in the theory of ordinals Richard Buchi Mon 03 December 2012
- Finite automata and the logic of one-place predicates B. A. Trakhtenbrot Mon 03 December 2012
- Weak second-order arithmetic and finite automata Richard Buchi Mon 03 December 2012
- A Myhill-Nerode theorem for automata with advice Alex Kruckman Sasha Rubin John Sheridan Ben Zax Tue 20 November 2012
- Unambiguous Tree Languages Are Topologically Harder Than Deterministic Ones Szczepan Hummel Tue 20 November 2012
- A polynomial time Presburger criterion and synthesis for number decision diagrams J. Leroux Tue 20 November 2012
- A BDD-Like Implementation of an Automata Package Jean-Michel Couvreur Tue 20 November 2012
- FAST Extended Release Sébastien Bardin Jérôme Leroux Gérald Point Tue 20 November 2012
- A Linear Algorithm for Testing Equivalence of Finite Automata John Hopcroft Richard Karp Tue 02 October 2012
- Checking NFA equivalence with bisimulations up to congruence Filippo Bonchi Damien Pous Tue 02 October 2012
- Antichain Algorithms for Finite Automata Laurent Doyen Jean-François Raskin Thu 27 September 2012
- Antichains: A New Algorithm for Checking Universality of Finite Automata M. De Wulf L. Doyen T. Henzinger J. Raskin Thu 27 September 2012
- Antichains for the Automata-Based Approach to Model-Checking Laurent Doyen Jean-Francois Raskin Thu 27 September 2012
- Lattice automata: a representation of languages over an infinite alphabet, and some applications to verification T. Le Gall B. Jeannet Mon 24 September 2012
- Implementing r-AFA Operations S. Huerter X. Wu K. Salomaa Sheng Yu Sun 23 September 2012
- Efficient Implementation of Regular Languages Using r-AFA K. Salomaa X. Wu Sheng Yu Sun 23 September 2012
- Predictable semiautomata Janusz Brzozowski Nicolae Santean Sun 23 September 2012
- When Simulation Meets Antichains Parosh Abdulla Yu-Fang Chen Lukáš Holík Richard Mayr Tomáš Vojnar Thu 13 September 2012
- Tighter Bounds for the Determinisation of Buchi Automata Sven Schewe Wed 22 August 2012
- Can Nondeterminism Help Complementation Yang Cai Ting Zhang Sat 07 July 2012
- Generalized Simulation Relations with Applications in Automata Theory Lorenzo Clemente Mon 11 June 2012
- State-complexity of finite-state devices, state compressibility and incompressibility Jean-Camille Birget Mon 28 May 2012
- Finite automata, definable sets, and regular expressions over In-tapes Yaacov Choueka Sun 27 May 2012
- Theories of automata on I-tapes: A simplified approach Yaacov Choueka Sun 27 May 2012
- Languages, Automata, and Logic Wolfgang Thomas Wed 23 May 2012
- From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata Nir Piterman Mon 21 May 2012
- Is the interesting part of process logic uninteresting: a translation from PL to PDL R. Sherman A. Pnueli D. Harel Wed 11 April 2012
- Logic and Automata over Infinite Trees Christof Løding Sun 08 April 2012
- Regular Cost Functions, Part I: Logic and Algebra over Words Thomas Colcombet Sat 07 April 2012
- On Translating Linear Temporal Logic into Alternating and Nondeterministic Automata Heikki Tauriainen Sat 07 April 2012
- Fast LTL to Buchi Automata Translation Paul Gastin Denis Oddoux Sat 07 April 2012
- Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata Juraj Hromkovic Sebastian Seibert Thomas Wilke Sat 07 April 2012
- Alternating automata and program verification Moshe Y. Vardi Thu 05 April 2012
- Forms of Determinism for Automata (Invited Talk) Thomas Colcombet Thu 05 April 2012
- Lecture notes on Automata, Logics, Algebras and Games K Narayan Kumar Thu 05 April 2012
- Finite-state Automata on Infinite Inputs Madhavan Mukund Thu 05 April 2012
- Reasoning about infinite computations Moshe Y. Vardi Pierre Wolper Wed 04 April 2012
- Model Checking Infinite-State Systems: Generic and Specific Approaches Anthony Widjaja Lin Tue 03 April 2012
- LTL to Buchi Automata Translation: Fast and More Deterministic Tomáš Babiak Mojmír Křetínský Vojtěch Řehák Jan Strejček Mon 02 April 2012
- Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic Automata Sebastian Preugschat Thomas Wilke Mon 02 April 2012
- Decidability of second-order theories and automata on infinite trees Michael O. Rabin Mon 12 March 2012
- Finite automata and their decision problems Michael O. Rabin Dana Scott Mon 12 March 2012
- Lecture Notes on Automata, Games and Verification Sven Schewe Bernd Finkbeiner Sat 03 March 2012
- Inclusion Testing of Büchi Automata Based on Well-Quasiorders Kyveli Doveri Pierre Ganty Francesco Parolini Francesco Ranzato Fri 02 March 2012
- History-Deterministic Timed Automata Thomas A. Henzinger Karoliina Lehtinen Patrick Totzke Fri 02 March 2012
Library Size: 13G (712 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A
