Tissue P systems with channel states

  • Authors:

  • Rudolf Freund;Gheorghe Paun;Mario J. Pérez-Jiménez

  • Affiliations:

  • Faculty of Informatics, Vienna University of Technology, Favoritenstr. 9-11, A-1040 Vienna, Austria;Inst. of Math. of the Romanian Acad., 014700 Bucureşti, Romania and Res. Grp. on Nat. Comp., Dept. of Comp. Sci. and Art. Intell., Univ. of Sevilla, Avda. Reina Mercedes s/n, 41012 Sevilla, S ...;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Avda. Reina Mercedes s/n, 41012 Sevilla, Spain

  • Venue:
  • Theoretical Computer Science - Insightful theory
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider tissue-like P systems with states associated with the links (we call them synapses) between cells, controlling the passage of objects across the links. We investigate the computing power of such devices for the case of using--in a sequential manner--antiport rules of small weights. Systems with two cells are proved to be universal when having arbitrarily many states and minimal antiport rules, or one state and antiport rules of weight two. Also the systems with arbitrarily many cells, three states, and minimal antiport rules are universal. In contrast, the systems with one cell and any number of states and rules of any weight only compute Parikh sets of matrix languages (generated by matrix grammars without appearance checking); characterizations of Parikh images of matrix languages are obtained for such one-cell systems with antiport rules of a reduced weight.