21 citations · 21 across the 7 of their papers we have counts for
1 paper · 1 filter
Aleksejs Naumovs, Maksims Dimitrijevs, Abuzer Yakaryılmaz
It is known that 2-state binary and 3-state unary probabilistic finite automata and 2-state unary quantum finite automata recognize uncountably many languages with cutpoints. These…