A characterization of the recursiveness of an m-adic probabilistic language

https://doi.org/10.1016/S0019-9958(78)90809-4Get rights and content
Under an Elsevier user license
open archive

It is shown that the language accepted by the m-adic two-state probabilistic acceptor at a given cut-point is a recursive language if and only if the cut-point is a Turing-computable real number.

Cited by (0)