Queue automaton

A queue machine or queue automaton is a finite state machine with the ability to store and retrieve data from an infinite-memory queue. It is a model of computation equivalent to a Turing machine, and therefore it can process any formal language.

Theory

We define a queue machine by the six-tuple

M = (Q, \Sigma, \Gamma, \$, s, \delta)

where

$\,Q$ is a finite set of states;
$\,\Sigma \subset \Gamma$ is the finite set of the input alphabet;
$\,\Gamma$ is the finite queue alphabet;
$\,\$ \in \Gamma - \Sigma$ is the initial queue symbol;
$\,s \in Q$ is the start state;
$\,\delta : Q \times \Gamma \rightarrow Q \times \Gamma^*$ is the transition function.

We define the current status of the machine by a configuration, an ordered pair of its state and queue contents $\,(q,\gamma)\in Q\times\Gamma^*$ (note $\,\Gamma^*$ defines the Kleene closure or set of all supersets of $\,\Gamma$ ). The starting configuration on an input string $\,x$ is defined as $\,(s,x\$)$ , and the transition $\rightarrow_M^1$ from one configuration to the next is defined as:

\,(p,A\alpha) \rightarrow_M^1 (q,\alpha\gamma)

where $A$ is a symbol from the queue alphabet, $\alpha$ is a sequence of queue symbols ( $\alpha \in \Gamma^*$ ), and $(q, \gamma) = \delta(p, A)$ . Note the "first-in-first-out" property of the queue in the relation.

The machine accepts a string $\,x\in\Sigma^*$ if after a (possibly infinite) number of transitions the starting configuration evolves to exhaust the string (reaching a null string $\,\epsilon$ ), or $\,(s,x\$)\rightarrow_M^*(q,\epsilon).$ ^[1]

Turing completeness

We can prove that a queue machine is equivalent to a Turing machine by showing that a queue machine can simulate a Turing machine and vice versa.

A Turing machine can be simulated by a queue machine that keeps a copy of the Turing machine's contents in its queue at all times, with two special markers: one for the TM's head position, and one for the end of the tape; its transitions simulate those of the TM by running through the whole queue, popping off each of its symbols and re-enqueing either the popped symbol, or, near the head position, the equivalent of the TM transition's effect.

A queue machine can be simulated by a Turing machine, but more easily by a multi-tape Turing machine, which is known to be equivalent to a normal single-tape machine. The simulating queue machine reads input on one tape and stores the queue on the second, with pushes and pops defined by simple transitions to the beginning and end symbols of the tape.^[2] A formal proof of this is often an exercise in theoretical computer science courses.

Applications

Queue machines offer a simple model on which to base computer architectures,^[3]^[4] programming languages, or algorithms.^[5]^[6]

References

↑ Kozen, Dexter C. (1997) [1951]. David Gries, Fred B. Schneider, ed. Automata and Computability (hardcover). Undergraduate Texts in Computer Science (1 ed.). New York: Springer-Verlag. pp. 368–370. ISBN 0-387-94907-0.
↑ Rus, Teodor. "Variants of Turing Machines". Lecture Notes Covering Theory of Computation. University of Iowa, Iowa City, IA, 52242-1419. Retrieved 2007-11-06.
↑ Feller, M.; M.D. Ercegovac (1981). "Queue machines: An organization for parallel computation". Lecture Notes in Computer Science 111: 37. doi:10.1007/BFb0105108. Retrieved 2007-11-06.
↑ Schmit, Herman; Benjamin Levine; Benjamin Ylvisaker (2002). "Queue Machines: Hardware Compilation in Hardware". 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'02): 152. doi:10.1109/FPGA.2002.1106670. Retrieved 2007-11-06.
↑ Moore, Christopher (1999-09-20). "Queues, Stacks, and Transcendentality at the Transition to Chaos". Algorithms Project's Seminar. INRIA. Retrieved 2007-11-06.
↑ von Thum, Manfred (2007). "A queue machine for evaluating expressions". LaTrobe University. Retrieved 2007-11-06.

Queue automaton

Theory

Turing completeness

Applications

See also

References