Notes on Stack Machines and Quantum Stack Machines
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915630967422976 |
|---|---|
| author | Qiu, Daowen |
| author_facet | Qiu, Daowen |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_17264 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Notes on Stack Machines and Quantum Stack Machines Qiu, Daowen Formal Languages and Automata Theory 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. |
| title | Notes on Stack Machines and Quantum Stack Machines |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2511.17264 |