Search

• < Previous
• 1
• Next >

---

Transforming structures by set interpretations

Thomas Colcombet ; Christof Löding.

We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas with free set variables. They transform a given structure into a structure with a domain consisting of finite sets of&nbsp;[&hellip;]

---

Playing Safe, Ten Years Later

Thomas Colcombet ; Nathanaël Fijalkow ; Florian Horn.

We consider two-player games over graphs and give tight bounds on the memory size of strategies ensuring safety objectives. More specifically, we show that the minimal number of memory states of a strategy ensuring a safety objective is given by the size of the maximal antichain of left quotients&nbsp;[&hellip;]

---