Abstract
We propose a new algorithm for checking language equivalence of non-deterministic Buchi automata. We start from a construction proposed by Calbrix, Ni......
小提示:本篇文献需要登录阅读全文,点击跳转登录