Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Queue automaton
open-in-new
<p>A queue machine, queue automaton, or pullup automaton (PUA) is a <a href="/facts/Finite-state_machine/GMusWd0a">finite-state machine</a> with the ability to store and retrieve data from an infinite-memory <a href="/facts/Queue_(data_structure)/hVPjPXus">queue</a>. Its design is similar to a <a href="/facts/Pushdown_automaton/kEPRC70F">pushdown automaton</a> but differs by replacing the stack with this queue. A queue machine is a model of computation equivalent to a <a href="/facts/Turing_machine/ojCtglYu">Turing machine</a>, and therefore it can process the same class of <a href="/facts/Formal_language/crDTyP8q">formal languages</a>. </p>