Showing 2025Show all
2 papers · 1 filter
cs.FL2025
Deterministic Suffix-reading Automata
R Keerthan, B Srivathsan, R Venkatesh +1
We introduce deterministic suffix-reading automata (DSA), a new automaton model over finite words. Transitions in a DSA are labeled with words. From a state, a DSA triggers an outg…
cs.GT2025
Simplifying imperfect recall games
Hugo Gimbert, Soumyajit Paul, B. Srivathsan
In games with imperfect recall, players may forget the sequence of decisions they made in the past. When players also forget whether they have already encountered their current dec…