科研之友
微信
新浪微博
Facebook
分享链接
摘要
In traditional automata theory, the closure with respect to certain operations is one of the most investigated properties, especially the methods of constructing automata for certain operations among the given sub-automata. However, up to now less effort has been addressed to this question for P automata. As an improvement on earlier results, we introduce P automata with communication and active membrane rules working in the initial mode (CAIP). We present methods for constructing automata that recognize the Union, the Concatenation, the Kleene Closure, or the omega Closure of the given languages which are represented by some P automata. We also show that for any language denoted by a regular expression, we can readily construct a CAIP automaton corresponding to it.
- 出版日期2007
- 单位上海交通大学
