Tissue P systems with minimal symport/antiport

6Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show that tissue P systems with symport/antiport having 3 cells and symport/antiport rules of minimal weight generate all recursively enumerable sets of numbers. Constructed systems simulate register machines and have purely deterministic behaviour. Moreover, only 2 symport rules are used and all symbols of any system are present in finite number of copies (except for symbols corresponding to registers of the machine). At the end of the article some open problems are formulated. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Verlan, S. (2004). Tissue P systems with minimal symport/antiport. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3340, 418–429. https://doi.org/10.1007/978-3-540-30550-7_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free