Abstract
We investigate the minimal cases for realtime probabilistic machines that can define uncountably many languages with bounded error. We show that logar......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
