Showing 2024Show all
2 papers · 1 filter
cs.FL2024
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.FL2024
A Myhill-Nerode style Characterization for Timed Automata With Integer Resets
Kyveli Doveri, Pierre Ganty, B. Srivathsan
The well-known Nerode equivalence for finite words plays a fundamental role in our understanding of the class of regular languages. The equivalence leads to the Myhill-Nerode theor…