Search

• < Previous
• 1
• Next >

---

Game Refinement Relations and Metrics

Luca de Alfaro ; Rupak Majumdar ; Vishwanath Raman ; Mariëlle Stoelinga.

We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a successor state. It is often advantageous for players to choose probability distributions over moves, rather than single moves.&nbsp;[&hellip;]

---

Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility

Anthony W. Lin ; Rupak Majumdar.

Word equations are a crucial element in the theoretical foundation of constraint solving over strings. A word equation relates two words over string variables and constants. Its solution amounts to a function mapping variables to constant strings that equate the left and right hand sides of the&nbsp;[&hellip;]

---