1 paper
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…