Jul 14, 2024

24.19 Reachability in Reversible Data VASS

Jul 13, 2024

24.17 Monotone regular functions

Jul 13, 2024

24.18 Lower bounds for determinizability of weighted automata over \(\mathbb Q\)

Jul 12, 2024

24.16 Speed of victory in adversarial population games

Jul 11, 2024

24.15 Games under delays and loss

Jul 05, 2024

24.6 Emptiness-checking for 3-clock Timed Automata with additive constraints

Jul 05, 2024

24.7 Minimality for Deterministic Suffix-reading Automata

Jul 05, 2024

24.8 Coverability in Wait-Only Networks with non-blocking bounded sendings

Jul 05, 2024

24.9 Is the Hierarchy of Valence Systems with Open Reachability Proper?

Jul 05, 2024

24.10 Functions Weakly-Computable by Vector Addition Systems

Jul 05, 2024

24.12 Fine-grained complexity of reachability in one-counter automata

Jul 05, 2024

24.13 Satisfiability of String Constraints with Subsequence relation

Jul 05, 2024

24.14 Extending asynchronous subtyping for binary session types

Jul 05, 2024

24.11 Membership of a coverability VASS in FO2

Jul 04, 2024

24.5 Properties of the value function in weighted timed games

Jul 02, 2024

24.3 Bi-reachability in Petri nets with ordered data

Jul 02, 2024

24.4 Language Equivalence between Nondeterministic and Deterministic One-Counter Machines

Jun 27, 2024

24.2 Positional Nash Equilibria

Jun 21, 2024

2024.1 How is $a^* = 1/(1-a)?$

Apr 29, 2024

23.6 Target for pushdown RBN

Apr 22, 2024

23.3 Reachability problem for thin 1-GVASS

Apr 22, 2024

23.4 Bounds on the length of a coverability path in VASS

Sep 16, 2023

23.1 TARGET in asynchronous shared-memory systems

Aug 09, 2023

23.5 Linear loop synthesis: When d variables are not enough.

Jul 25, 2023

23.2 $o(n^2)$-time algorithm for coverability in 1-VASS

Sep 16, 2022

22.1 Complexity of fixed VAS reachability

Sep 16, 2022

22.2 Paired Counter Automata

Sep 16, 2022

22.3 Universal coverability for Orthant VAS

Sep 16, 2022

22.4 Reconfigurable broadcast networks (RBN)

Sep 16, 2022

22.5 Decidability of $(\min,+)$-weighted automata determinization

Sep 16, 2022

22.6 Completing Partial DFAs to Synchronizing DFAs

Sep 16, 2022

22.7 Equivalent k-HD-TA for a given 1-NTA

Sep 16, 2022

22.8 From two-way to one-way transducers, revisited

Sep 16, 2022

22.9 Constructive Zermelo's Problem

Sep 16, 2022

22.10 The Parity Language

Sep 16, 2022

22.12 3-decomposition Conjecture

Sep 16, 2022

22.13 Büchi automata using graph neural networks

Sep 16, 2022

22.14 Transformation monoid minimisation

Sep 16, 2022

22.15 Universal Positivity Set

Sep 16, 2022

22.16 Is Markov reachability problem Skolem-Hard for Ergodic Markov chains?

Sep 16, 2022

22.17 Eventual non-negativity of Matrices

Sep 16, 2022

22.18 Learning sequences

Sep 16, 2022

22.19 Membership in Reversed Partially-Ordered Automata

Nov 03, 2020

20.9 Memory requirements for generalized reachability games

Nov 03, 2020

20.10 Tighten the complexity of solving random-turn games

Nov 03, 2020

20.11 The sequential flow problem

Nov 03, 2020

20.12 Succinctness of GFG pushdown automata

Aug 03, 2020

20.8 Good games for good-for-games automata

Jul 21, 2020

20.1 Universality of letter-bounded CFLs

Jul 21, 2020

20.2 Deterministic separability of nondeterministic timed languages

Jul 21, 2020

20.3 Prime DOCAs

Jul 21, 2020

20.4 Populations of Markov decision processes, what we know and an open question

Jul 21, 2020

20.5 Regular antichain subset of the iteration of a regular language

Jul 21, 2020

20.6 Branching Immediate Observation nets

Jul 21, 2020

20.7 Equivalence of Cost Register Automata: the quest for decidability

Jul 19, 2019

19.17 Existence of a universal amplifier of selection

Jul 19, 2019

19.16 Weak validation of tree-languages by extended automata

Jul 19, 2019

19.15 The busy beaver problem for population protocols

Jul 19, 2019

19.14 Continuous reachability in ordered data VAS

Jul 19, 2019

19.13 Does a $(\textsf{min,+})$-WA preserve REG by inverse image?

Jul 19, 2019

19.12 Reachability for bounded branching VASS

Jul 19, 2019

19.11 Shortest runs in 3-D VASS

Jul 19, 2019

19.10 Variants of one-counter systems universality

Jul 19, 2019

19.8 Logic and automata for multiply nested-words

Jul 19, 2019

19.7 Membership in logical classes for (succinct) finite automata

Jul 19, 2019

19.6 HyperLTL satisfiability

Jul 19, 2019

19.5 On unambiguous grammars

Jul 19, 2019

19.4 Separating words problem

Jul 19, 2019

19.3 Universality for unambiguous automata

Jul 19, 2019

19.2 SafeLTL

Jul 19, 2019

19.1 Deciding upperboundedness of \(\bbZ\)-CCRA