Queue machine

From Wikipedia, the free encyclopedia

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.

1 Theory
- 1.1 Turing completeness
2 Applications
3 References
4 See also

[edit] 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$ 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$ ). Therefore the starting configuration on an input string $\,x$ is defined as $\,(s,x\$)$ , and we can define our transition as the function that, given an initial state and queue, takes the function to a new state and queue. Note the "first-in-first-out" property of the queue in the relation

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

where $\,\rightarrow_M^1$ defines the next configuration relation, or simply the transition function from one configuration to the next.

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].

[edit] 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. In the former case, one can see that the left-right movements along the Turing machine tape can be simulated by continuously pushing and popping from the queue, so that the whole of the tape is stored in the queue. The queue machine's alphabet only has to indicate with a new symbol those elements which are being read by the Turing machine so that it can properly transition its state.

In the latter case of simulating a queue machine on a Turing machine, this is done more easily using a multi-tape Turing machine, which is equivalent to a normal single-tape machine. Then one simply reads input on one tape and stores the queue in 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.

[edit] Applications

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

[edit] References

^ Kozen, Dexter C. [1951] (1997). in David Gries, Fred B. Schneider: Automata and Computability (hardcover), 1, Undergraduate Texts in Computer Science (in English), New York: Springer-Verlag, 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 on 2007-11-06.}}
^ Feller, M.; M.D. Ercegovac (1981). "Queue machines: An organization for parallel computation". Lecture Notes in Computer Science.
^ Schmit, Herman; Benjamin Levine, Benjamin Ylvisaker. "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.
^ Moore, Christopher (1999-09-20). Queues, Stacks, and Transcendentality at the Transition to Chaos. Algorithms Project's Seminar. INRIA. Retrieved on 2007-11-06.
^ von Thum, Manfred (2007). A queue machine for evaluating expressions. LaTrobe University. Retrieved on 2007-11-06.