2 papers
cs.LO2026
On Probabilistic -Pushdown Systems, and -Probabilistic Computational Tree Logic
Deren Lin, Tianrong Lin
In this paper, we define the notion of a {\em probabilistic -pushdown automaton} and study its model-checking problem against -probabilistic computational tree logic (-…
cs.LO2026
Computational Complexity of Model-Checking Quantum Pushdown Systems
Deren Lin, Tianrong Lin
In this paper, we study the problem of model-checking quantum pushdown systems from a computational complexity point of view. We arrive at the following equally important, interest…