Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEICE Transactions on Information and Systems

Expressive Power of Quantum Pushdown Automata with Classical Stack Operations under the Perfect-Soundness Condition(Computation and Computational Models)

Masaki Nakanishi, Kiyoharu Hamaguchi, Toshinobu Kashiwabara

Published Mar 1, 2006• 0 citations
OpenAlex

Related papers

On the Power of One-Sided Error Quantum Pushdown Automata with Classical Stack Operations

Masaki Nakanishi

Lecture notes in computer science•Jan 1, 2004•2 citations

Quantum Pushdown Automata with Classical Stack and Tape Head.

Jismy Joseph, K. S. Dersanambika

International Journal of Software and Informatics•Jan 1, 2014•0 citations

QUANTUM PUSHDOWN AUTOMATA THAT CAN DETERMINISTICALLY SOLVE A CERTAIN PROBLEM

Yumiko Murakami, Masaki Nakanishi, Shigeru Yamashita +1 more

International Symposium on Mesoscopic Superconductivity and Spintronics (MS+S)•Aug 1, 2005•0 citations

Quantum Pushdown Automata

Daowen Qiu

International Journal of Theoretical Physics•Sep 1, 2002•10 citations

Quantum Pushdown Automata

Marats Golovkins

Lecture notes in computer science•Jan 1, 2000•32 citations

Automata theory based on quantum logic: Reversibilities and pushdown automata

Daowen Qiu

Theoretical Computer Science•May 25, 2007•49 citations