Live briefing

Everything about Queue automaton

Computation model, equivalent to Turing machines

A queue machine, queue automaton, or pullup automaton 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. Wikipedia →

🧭 Start here: a 6-step reading path

Read the overview: Queue automatonA 5-minute orientation
Skim a recent paper: Ecological Driving for Connected and Automated Vehicles at Unsaturated Intersections Considering Queue EffectsInfluential work since 2022
Read the landmark paper: Queueing behaviors at exit in cellular automaton model with S-queueCited 9 times
Go sideways: Pushdown automatonA closely related topic
Go sideways: Read-only Turing machineA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

🏆 Landmark papers (most cited)

Queueing behaviors at exit in cellular automaton model with S-queue

Di Zhou, Jun Hu, Xiaoling Gao · 2019 · International Journal of Modern Physics B · 9 citations

🆕 Influential since 2022

Ecological Driving for Connected and Automated Vehicles at Unsaturated Intersections Considering Queue Effects

Chunjie Zhai, Chuqiao Chen, Xiangyu Yang · 2022 · IEEE Transactions on Vehicular Technology · 29 citations
Forecasting the Passage Time of the Queue of Highly Automated Vehicles Based on Neural Networks in the Services of Cooperative Intelligent Transport Systems

Vladimir Shepelev, Sultan Zhankaziev, Sergey Aliukov · 2022 · Mathematics · 25 citations

📚 Books worth reading

Open Library didn't respond; try again in a moment.

🔗 Related topics

Pushdown automaton In the theory of computation, a branch of theoretical computer science, a pushdown automaton (PDA) is a type of automaton that employs a stack. Pushdown…
Read-only Turing machine A read-only Turing machine or two-way deterministic finite-state automaton (2DFA) is class of models of computability that behave like a standard Turing…
Deterministic finite automaton In the theory of computation, a branch of theoretical computer science, a deterministic finite automaton (DFA) is a finite-state machine that accepts or…
Automata theory Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in…
Finite-state transducer A finite-state transducer (FST) is a finite-state machine with two memory tapes, following the terminology for Turing machines: an input tape and an output…
Quantum Turing machine A quantum Turing machine (QTM) or universal quantum computer is an abstract machine used to model the effects of a quantum computer. It provides a simple…
Nondeterministic Turing machine In theoretical computer science and computational theory, a nondeterministic Turing machine (NTM) is a theoretical model of computation whose governing…
Nondeterministic finite automaton In automata theory, a finite-state machine is called a deterministic finite automaton (DFA), if each of its transitions is uniquely determined by its source…