Abstract
CCS(h; k) is the CCS subcalculus which can use at most h constants and k actions. We show that CCS(25,12) is Turing-complete by simulating Neary and W......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
