Finite-memory automata
Michael Kaminski, Nissim Francez · Theoretical Computer Science · 1994
A model of computation dealing with infinite alphabets is proposed. This model is based on replacing the equality test by substitution. It appears to be a natural generalization of the classical Rabin-Scott finite-state automata and possesses many of their closure and decision properties. Also, when restricted to finite alphabets the model is equivalent to finite-state automata.