On 1-Inkdot Self-Verifying Nondeterministic and Nondeterministic Pushdown Automata with Small Space
A relationship between the accepting powers of 1-inkdot nondeterministic and self-verifying nondeterministic pushdown automata with small space is investigated. It is shown that sublogarithmic space-bounded 1-inkdot nondeterministic pushdown automata are more powerful than 1-inkdot self-verifying nondeterministic pushdown automata with the same space.
Jianliang Wang Jianliang Xu
College of Information Science and Engineering, Ocean University of China Qingdao, China 266071;Shan College of Information Science and Engineering Ocean University of China Qingdao, China 266071
国际会议
南宁
英文
2007-07-20(万方平台首次上网日期,不代表论文的发表时间)