Abstract
The time complexity of 1-limited automata is investigated from a descriptional complexity view point. Though the model recognizes regular languages on......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
