10 citations · 14 across the 3 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.FL2016★ 10 cited
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…
cs.FL2016
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…