Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bernardini, F., Gheorghe, M., Krasnogor, N., Păun, Gh.: Turing Machines with Cells on the Tape. In: Proc. of the ESF Exploratory Workshop on Cellular Computing (Complexity Aspects), Sevilla (Spain), January 31 - February 2, 2005, pp. 63–74 (2005)
Freund, R., Păun, Gh.: On deterministic P systems (submitted, 2004)
Freund, R., Martin-Vide, C., Obtulowicz, A., Păun, G.: On three classes of automata-like P systems. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 292–303. Springer, Heidelberg (2003)
Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs (1967)
Păun, A., Păun, Gh.: The Power of Communication: P Systems with Symport/Antiport. New Generation Computers 20(3), 295–306 (2002)
Păun, Gh.: Membrane Computing: An Introduction. Springer, Berlin (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ramesh, H., Krishna, S.N., Rama, R. (2006). On the Power of Bio-Turing Machines. In: Calude, C.S., Dinneen, M.J., Păun, G., Rozenberg, G., Stepney, S. (eds) Unconventional Computation. UC 2006. Lecture Notes in Computer Science, vol 4135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11839132_20
Download citation
DOI: https://doi.org/10.1007/11839132_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38593-6
Online ISBN: 978-3-540-38594-3
eBook Packages: Computer ScienceComputer Science (R0)