Queue automaton
id:
queue-automaton-231-4181541
title:
Queue automaton
text:
A queue machine, queue automaton, or pullup automaton (PUA) is a finite state machine with the ability to store and retrieve data from an infinite-memory queue. Its design is similar to a pushdown automaton but differs by replacing the stack with this queue. A queue machine is a model of computation equivalent to a Turing machine, and therefore it can process the same class of formal languages.
brand slug:
wiki
category slug:
encyclopedia
description:
Computation model, equivalent to Turing machines
original url:
https://en.wikipedia.org/wiki/Queue_automaton
date created:
2007-11-06T03:54:17Z
date modified:
2024-09-15T22:46:08Z
main entity:
{"identifier":"Q7271583","url":"https://www.wikidata.org/entity/Q7271583"}
image:
fields total:
13
integrity:
15