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;]

---

Graph Logics with Rational Relations

Pablo Barcelo ; Diego Figueira ; Leonid Libkin.

We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying graph topology, which have recently found numerous applications. Such logics use conditions on paths expressed by regular languages&nbsp;[&hellip;]

---

Reasoning about Data Repetitions with Counter Systems

Stephane Demri ; Diego Figueira ; M Praveen.

We study linear-time temporal logics interpreted over data words with multiple attributes. We restrict the atomic formulas to equalities of attribute values in successive positions and to repetitions of attribute values in the future or past. We demonstrate correspondences between satisfiability&nbsp;[&hellip;]

---

Bottom-up automata on data trees and vertical XPath

Diego Figueira ; Luc Segoufin.

A data tree is a finite tree whose every node carries a label from a finite alphabet and a datum from some infinite domain. We introduce a new model of automata over unranked data trees with a decidable emptiness problem. It is essentially a bottom-up alternating automaton with one register that can&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;]

---