Notes on Stack Machines and Quantum Stack Machines
By: Daowen Qiu
Potential Business Impact:
Makes computers understand more complex languages.
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.
Similar Papers
Visual Execution and Validation of Finite-State Machines and Pushdown Automata
Formal Languages and Automata Theory
Helps students learn how computers think.
Design Support for Multitape Turing Machines
Formal Languages and Automata Theory
Shows how complex computer programs work.
Inference of Deterministic Finite Automata via Q-Learning
Formal Languages and Automata Theory
Teaches computers to learn patterns from examples.