10 citations · 14 across the 3 of their papers we have counts for
5 papers · 1 filter
On Injectivity of Quantum Finite Automata
Paul C. Bell, Mika Hirvensalo
We consider notions of freeness and ambiguity for the acceptance probability of Moore-Crutchfield Measure Once Quantum Finite Automata (MO-QFA). We study the injectivity problem of…
Computational Limitations of Affine Automata
Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryılmaz
We present two new results on the computational limitations of affine automata. First, we show that the computation of bounded-error rational-values affine automata is simulated in…
On the computational power of affine automata
Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryılmaz
We investigate the computational power of affine automata (AfAs) introduced in [4]. In particular, we present a simpler proof for how to change the cutpoint for any affine language…
Decision problems on unary probabilistic and quantum automata
Mika Hirvensalo, Abuzer Yakaryılmaz
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 the emptiness problems fo…
Alternating, private alternating, and quantum alternating realtime automata
Gökalp Demirci, Mika Hirvensalo, Klaus Reinhardt +2
We present new results on realtime alternating, private alternating, and quantum alternating automaton models. Firstly, we show that the emptiness problem for alternating one-count…