Search

• < Previous
• 1
• Next >

---

Alternating register automata on finite words and trees

Diego Figueira.

We study alternating register automata on data words and data trees in relation to logics. A data word (resp. data tree) is a word (resp. tree) whose every position carries a label from a finite alphabet and a data value from an infinite domain. We investigate one-way automata with alternating&nbsp;[&hellip;]

---

Playing with Repetitions in Data Words Using Energy Games

Diego Figueira ; Anirban Majumdar ; M. Praveen.

We introduce two-player games which build words over infinite alphabets, and we study the problem of checking the existence of winning strategies. These games are played by two players, who take turns in choosing valuations for variables ranging over an infinite data domain, thus generating&nbsp;[&hellip;]

---