Abstract
We introduce Symbolic Alternating Finite Automata (s-AFA) as a succinct and decidable model for describing sets of finite sequences over arbitrary alp......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
