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]

Authors

Aleksejs Naumovs

This author has not been identified. Look up 'Aleksejs Naumovs' in Google

Maksims Dimitrijevs

This author has not been identified. Look up 'Maksims Dimitrijevs' in Google

Abuzer Yakaryilmaz

This author has not been identified. Look up 'Abuzer Yakaryilmaz' in Google