In this paper, we continue the study of Bio-Turing machines introduced in [1]. It was proved in [1] that using two differentiated cells, and using antiport rules of weight 2, one can recognize the family 1RE. We show here that with just one differentiated cell, 1RE can be characterized, by using antiport rules of weight 2, or by using symport rules of weight 3. We also prove that RE can be characterized using arbitrary alphabets, using 2 differentiated cells, and antiport rules of weight 2. Finally, we examine the computational power when there are no differentiated cells and show that non-regular languages can be accepted. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Ramesh, H., Krishna, S. N., & Rama, R. (2006). On the power of bio-turing machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4135 LNCS, pp. 243–253). Springer Verlag. https://doi.org/10.1007/11839132_20
Mendeley helps you to discover research relevant for your work.