当前位置: X-MOL 学术Acta Inform. › 论文详情
Complement for two-way alternating automata
Acta Informatica ( IF 1.042 ) Pub Date : 2020-02-17 , DOI: 10.1007/s00236-020-00373-8
Viliam Geffert, Christos A. Kapoutsis, Mohammad Zakzok

Abstract We consider the problem of converting a two-way alternating finite automaton (2AFA) with n states to a 2AFA accepting the complement of its language. Complementing is trivial for halting2AFAs, by swapping the roles of existential and universal decisions and the roles of accepting and rejecting states. However, since 2AFAs do not have resources to detect infinite loops by counting executed steps, it was not known whether the cost of complementing is polynomial in n in the general case. Here we shall show that 2AFAs can be complemented by using \(O(n^7)\) states.
更新日期:2020-02-18

 

全部期刊列表>>
向世界展示您的会议墙报和演示文稿
全球疫情及响应:BMC Medicine专题征稿
欢迎探索2019年最具下载量的化学论文
新版X-MOL期刊搜索和高级搜索功能介绍
化学材料学全球高引用
ACS材料视界
x-mol收录
自然科研论文编辑服务
南方科技大学
南方科技大学
西湖大学
中国科学院长春应化所于聪-4-8
复旦大学
课题组网站
X-MOL
深圳大学二维材料实验室张晗
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug