Tissue p systems with antiport rules and small numbers of symbols and cells

  • Authors:

  • Artiom Alhazov;Rudolf Freund;Marion Oswald

  • Affiliations:

  • ,Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain;Faculty of Informatics, Vienna University of Technology, Vienna, Austria;Faculty of Informatics, Vienna University of Technology, Vienna, Austria

  • Venue:
  • DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider tissue P systems with antiport rules and investigate their computational power when using only a (very) small number of symbols and cells. Even when using only one symbol, any recursively enumerable set of natural numbers can be generated with at most seven cells. On the other hand, with only one cell we can only generate regular sets when using one channel with the environment, whereas one cell with two channels between the cell and the environment obtains computational completeness with at most five symbols. Between these extreme cases of one symbol and one cell, respectively, there seems to be a trade-off between the number of cells and the number of symbols, e.g., for the case of tissue P systems with two channels between a cell and the environment we show that computational completeness can be obtained with two cells and three symbols as well as with three cells and two symbols, respectively.