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

Aleksejs Naumovs, Maksims Dimitrijevs, Abuzer Yakaryilmaz. The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints. Discrete Mathematics & Theoretical Computer Science, 22(1), 2020. [doi]

Abstract

Abstract is missing.