FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT
Michael Kaminski, Daniel Zeitlin · International Journal of Foundations of Computer Science · 2010
In this paper we extend finite-memory automata with non-deterministic reassignment that allows an automaton to "guess" the future content of its registers, and introduce the corresponding notion of a regular expression over an infinite alphabet.