Abstract
Unambiguous automata are nondeterministic automata in which every word has at most one accepting run. In this paper we give a polynomial-time algorith......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
