We show that bounded-error affine finite automata recognize uncountably many (and so some non-Turing recognizable) languages when using real-valued transitions.
翻译:我们显示,在使用实际价值的过渡时,捆绑的-error afinite contalmata在使用实际价值的过渡时承认许多(因此有些是不可想象的)语言。