1 paper
Jos C. M. Baeten, Bas Luttik
We consider the computational model of the Queue Automaton. An old result is that the deterministic queue automaton is equally expressive as the Turing machine. We introduced the R…