Image de couverture de livre

Doubly Fair Parity Games

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hausmann, Daniel, Piterman, Nir, Sağlam, Irmak, Schmuck, Anne-Kathrin
Format:	Preprint
Publié:	2023
Sujets:	Computer Science and Game Theory 68Q45 F.4.3
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Positional $ω$-regular languages
par: Casares, Antonio, et autres
Publié: (2024)

Alternating Nominal Automata with Name Allocation
par: Frank, Florian, et autres
Publié: (2024)

From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism
par: Casares, Antonio, et autres
Publié: (2023)

The memory of $ω$-regular and BC($Σ_2^0$) objectives
par: Casares, Antonio, et autres
Publié: (2025)

Layered automata: A canonical model for automata over infinite words
par: Casares, Antonio, et autres
Publié: (2026)

The Complexity of Simplifying $ω$-Automata through the Alternating Cycle Decomposition
par: Casares, Antonio, et autres
Publié: (2024)

Transition-based vs stated-based acceptance for automata over infinite words
par: Casares, Antonio
Publié: (2025)

The Algebra of Nondeterministic Finite Automata
par: Gorrieri, Roberto
Publié: (2023)

Axiomatizing NFAs Generated by Regular Grammars
par: Gorrieri, Roberto
Publié: (2024)

A Formalization of Co-Transcriptional Splicing as an Operation on Formal Languages
par: Cho, Da-Jung, et autres
Publié: (2025)

On universality of regular realizability problems
par: Rubtsov, Alexander, et autres
Publié: (2023)

Eve-positional languages: putting order into Büchi automata
par: Idir, Olivier
Publié: (2026)

Decomposition of Automata recognizing Ideals
par: Berry, Mathias, et autres
Publié: (2026)

Learning Automata with Name Allocation
par: Frank, Florian, et autres
Publié: (2025)

Deciding Sparseness of Regular Languages of Finite Trees and Infinite Words
par: Eickmeyer, Kord, et autres
Publié: (2025)

Using games and universal trees to characterise the nondeterministic index of tree languages
par: Idir, Olivier, et autres
Publié: (2025)

Nominal Tree Automata With Name Allocation
par: Prucker, Simon, et autres
Publié: (2024)

An algebraic characterisation of Eve-positional languages
par: Colcombet, Thomas, et autres
Publié: (2026)

Generalized Parikh Matrices For Tracking Subsequence Occurrences
par: Fazekas, Szilárd Zsolt, et autres
Publié: (2024)

Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
par: Adsul, Bharat, et autres
Publié: (2024)

Commutative N-polyregular functions
par: Lopez, Aliaume
Publié: (2024)

Well-Quasi-Orderings on Word Languages
par: Lhote, Nathan, et autres
Publié: (2025)

Hamming distance between finite transducers
par: Dartois, Luc, et autres
Publié: (2026)

On the Equivalence Checking Problem for Deterministic Top-Down Tree Automata
par: Deng, Zhibo, et autres
Publié: (2025)

Recursive windows for grammar logics of bounded density
par: Gasquet, Olivier
Publié: (2025)

PSPACE-completeness of bimodal transitive weak-density logic
par: Balbiani, Philippe, et autres
Publié: (2025)

Evaluating Massively Parallel Algorithms for DFA Minimisation, Equivalence Checking and Inclusion Checking
par: Heemstra, Jan, et autres
Publié: (2025)

On Transition Constructions for Automata -- A Categorical Perspective
par: Cruchten, Mike
Publié: (2024)

Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
par: Guillon, Bruno, et autres
Publié: (2025)

Kleene Theorems for Lasso Languages and $ω$-Languages
par: Cruchten, Mike
Publié: (2024)

Jump Complexity of Deterministic Finite Automata with Translucent Letters
par: Fazekas, Szilárd Zsolt, et autres
Publié: (2025)

Input-Erasing Two-Way Finite Automata
par: Meduna, Alexander, et autres
Publié: (2025)

Fair Quantitative Games
par: Anand, Ashwani, et autres
Publié: (2025)

Decision Problems on Copying and Shuffling
par: Halava, Vesa, et autres
Publié: (2023)

Around Context-Free Grammars -- a Normal Form, a Representation Theorem, and a Regular Approximation
par: Cojocaru, Liliana
Publié: (2015)

Active Learning of Mealy Machines with Timers
par: Bruyère, Véronique, et autres
Publié: (2024)

The Generation-Recognition Asymmetry: Six Dimensions of a Fundamental Divide in Formal Language Theory
par: Peyrichou, Romain
Publié: (2026)

A Logic For Fresh Labelled Transition Systems
par: Bandukara, Mohamed H, et autres
Publié: (2025)

Weighing Obese Timed Languages
par: Asarin, Eugene, et autres
Publié: (2025)

Computing the Bandwidth of Meager Timed Automata
par: Asarin, Eugene, et autres
Publié: (2024)