Oct 5, 2016 · We present the current status of the emptiness problems for unary probabilistic and quantum automata with connections with Skolem's and ...
We present the current status of the emptiness problems for unary probabilistic and quantum automata with connections with Skolem's and positivity problems. We ...
scholar.google.com › citations
We study the recognition of R-trivial idempotent (R1) languages by various models of "decide-and-halt" quantum finite automata (QFA) and probabilistic ...
Aug 13, 2018 · Mika Hirvensalo, Abuzer Yakaryilmaz: Decision problems on unary probabilistic and quantum automata. CoRR abs/1610.01397 (2016).
It is well known that the emptiness problem for binary probabilistic automata and so for quantum automata is undecidable. We present the current status of ...
Sep 30, 2024 · Mika Hirvensalo, Abuzer Yakaryilmaz: Decision problems on unary probabilistic and quantum automata.
Duration: 58:32
Posted: May 2, 2012
Posted: May 2, 2012
Abstract. We continue the systematic investigation of probabilistic and quantum finite automata (PFAs and QFAs) on promise problems by focusing on unary ...
We continue the systematic investigation of probabilistic and quantum finite automata (PFAs and QFAs) on promise problems by focusing on unary languages.
Feb 5, 2015 · We continue the systematic investigation of probabilistic and quantum finite automata (PFAs and QFAs) on promise problems by focusing on unary languages.
Missing: Decision | Show results with:Decision