The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints

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…