Jul 01, 2025

25.19 Complete techniques for deducing Fair Almost-Sure Termination

Jul 01, 2025

25.18 Lower-bound for the decision of guidability

Jul 01, 2025

25.17 Tree automata with constraints on infinite trees

Jul 01, 2025

25.16 Normal-closure-equivalence of RAAG- and counter-automata

Jul 01, 2025

25.15 Complexity of Maximising reachability for target sets of size 1

Jul 01, 2025

25.14 Complexity of Explorability games on temporal graphs

Jul 01, 2025

25.13 Learning 1-DTA

Jul 01, 2025

25.12 Complexity of Reachability in Fixed-Dimensional Continuous VASS

Jul 01, 2025

25.11 Logical Characterisation of Deterministic Büchi Register Automata

Jul 01, 2025

25.10 Fine Grained Complexity for VAS Boundedness