%0 Journal Article
%A Naumovs, Aleksejs
%A Dimitrijevs, Maksims
%A Yakaryılmaz, Abuzer
%T The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints
%J Discrete mathematics & theoretical computer science
%D 2020-2021
%V 22
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-22-1-13/
%R 10.23638/DMTCS-22-1-13
%G en
%F DMTCS_2020_22_1_a12