Building Combinational P Automata with Rewriting and Active Membrane Rules

摘要：

　　In this paper,we introduce the RADP automata,which are a combination of P au- tomata deˉned in 4,5 with rewriting and active membrane (division and dissolving) rules.We present methods for constructing combinational automata that recognize the union,concatena- tion,or Kleene star of languages which are given by P automata.We also show that for any language denoted by a regular expression,we can construct a RADP automaton corresponding to it.

作者: Huan Long Yuxi Fu

作者单位: BASICS,Department of Computer Science and Engineering Shanghai Jiao Tong University,200240,Shanghai,P.R. China

会议类型: 国际会议

会议名称: International Conference on Bio-Inspired Computing -Theory and Applications(Bic-ta 2006)2006年国际生物计算:理论及应用国际会议

会议地点: 武汉

会议语种:英文

页码: 154-159

在线出版日期: 2006-09-18（万方平台首次上网日期，不代表论文的发表时间）