Search

• < Previous
• 1
• Next >

---

Register Games

Karoliina Lehtinen ; Udi Boker.

The complexity of parity games is a long standing open problem that saw a major breakthrough in 2017 when two quasi-polynomial algorithms were published. This article presents a third, independent approach to solving parity games in quasi-polynomial time, based on the notion of register game, a&nbsp;[&hellip;]

---

Families of DFAs as Acceptors of $\omega$-Regular Languages

Dana Angluin ; Udi Boker ; Dana Fisman.

Families of DFAs (FDFAs) provide an alternative formalism for recognizing $\omega$-regular languages. The motivation for introducing them was a desired correlation between the automaton states and right congruence relations, in a manner similar to the Myhill-Nerode theorem for regular languages.&nbsp;[&hellip;]

---

Token Games and History-Deterministic Quantitative-Automata

Udi Boker ; Karoliina Lehtinen.

A nondeterministic automaton is history-deterministic if its nondeterminism can be resolved by only considering the prefix of the word read so far. Due to their good compositional properties, history-deterministic automata are useful in solving games and synthesis problems. Deciding whether a given&nbsp;[&hellip;]

---