Abstract
A nondeterministic finite automaton is unambiguous if it has at most one accepting computation on every input string. We investigate the state complex......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
