Notes on Stack Machines and Quantum Stack Machines
Formal Languages and Automata Theory
2025-11-24 v1
Abstract
Multi-stack machines and Turing machines can simulate to each other. In this note, we give a succinct definition of multi-stack machines, and from this definition it is clearly seen that pushdown automata and deterministic finite automata are special cases of multi-stack machines. Also, with this mode of definition, pushdown automata and deterministic pushdown automata are equivalent and recognize all context-free languages. In addition, we are motivated to formulate concise definitions of quantum pushdown automata and quantum stack machines.
Keywords
Cite
@article{arxiv.2511.17264,
title = {Notes on Stack Machines and Quantum Stack Machines},
author = {Daowen Qiu},
journal= {arXiv preprint arXiv:2511.17264},
year = {2025}
}
Comments
11 pages, 3 figure, comments are welcome