Showing 1–20 of 29 results
/ Date/ Name
Jun 3, 2019An Operational Guide to MonitorabilityOct 27, 2021Token Games and History-Deterministic Quantitative-AutomataJan 25, 2022On the Translation of Automata to Linear Temporal LogicJun 27, 2019Good for Games Automata: From Nondeterminism to AlternationJan 13, 2020Good-for-games $ω$-Pushdown AutomataFeb 27, 2019Register GamesOct 27, 2021History Determinism vs. Good for Gameness in Quantitative AutomataMar 9, 2017$Σ^μ_2$ is decidable for $Π^μ_2$Aug 16, 2017The Descriptive Complexity of Modal $μ$ Model-checking GamesJul 15, 2022Parikh Automata over Infinite WordsApr 26, 2019Improving the complexity of Parys' recursive algorithmMar 29, 2019Alternating Weak Automata from Universal TreesSep 29, 2020On the Succinctness of Alternating Parity Good-for-Games AutomataMay 7, 2023From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) DeterminismSep 16, 2022History-deterministic Parikh AutomataApr 24, 2022On the size of good-for-games Rabin automata and its link with the memory in Muller gamesJul 11, 2024History-Determinism vs Fair SimulationApr 6, 2023History-deterministic Timed AutomataSep 10, 2015Disjunctive form and the modal $μ$ alternation hierarchyNov 6, 2025Explorability in Pushdown Automata