The week's pick
Random Articles
Reseach Article
A Membrane Turing Machine
| International Journal of Applied Information Systems |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 6 - Number 4 |
| Year of Publication: 2013 |
| Authors: Mahmoud Abdelaziz, Amr Badr, Ibrahim Farag |
10.5120/ijais13-451031
|
Mahmoud Abdelaziz, Amr Badr, Ibrahim Farag . A Membrane Turing Machine. International Journal of Applied Information Systems. 6, 4 ( October 2013), 1-6. DOI=10.5120/ijais13-451031
Abstract
Membrane Computing (MC) (or P System theory) is a recent area of Natural Computing, the field of computer science that deals with computational techniques is inspired by the structure and functioning of living cells. P systems are massively parallel and distributed model of computation. Membrane Computing investigates models of computation inspired by the structure and functions of biological cells. There are some simulations models that have been developed but do not usually allow parallelism. Turing Machine (TM) and membrane computing are computation models; one of the main differences between them is the behavior of each other, since TM is algorithmic behavior while on the other hand Transition P Systems are Interactive computing behavior. This research investigates a Turing machine model of a special class of P system under a condition which is the rules are applied in a predefined order (which is applying rules priority). From this point of view, the P Systems could assume the same behavior of Turing machine in its sequential behavior. A single membrane can be considered as a machine (membrane devices) in the membrane structure of transition P Systems; hence the whole system of membrane structure consists of several machines that interact with each other. The interaction can be in the form of data passing. The aim of this research is designing a TM to simulate the behavior of a Transition P System. Also the research will show how Turing Machine can be partitioned into sub machines as well as the design of membrane machines can be partitioned into sub machines or sub modules.
References
- N. Mathur, Beyond the Silicon Roadmap, Nature, 419, 6907, October 10, 2002, 573-575.
- S. De Franceschi, L. Kouwenhoven. Electronics and the Single Atom. Nature, 417, June 13 2002, 701-702.
- International Technology Roadmap for Semiconductors, Semiconductor Industry Association, http://public. itrs. net/Files/2001ITRS, 2001.
- G. P?un. "Computing with membranes" In Turku University Computer Sci¬ence Research Report No. 208, 1998.
- Gheorghe Paun, A quick introduction to membrane computing, The Journal of Logic and Algebraic Programming, 79, 2010, 291-294
- Rozenberg G. , B¨ack T. , Kok J. N. , eds. (2011) Handbook of Natural Computing, volume II. Springer.
- G. Ciobanu, G. Wenyuan, "A P System running on a cluster of computers", Proceedings of Membrane Computing. International Workshop, Tarragona (Spain). Lecture Notes in Computer Science, vol 2933 (2003) 123-150.
- A. Syropoulos, E. G. Mamatas, P. C. Allilomes, K. T. Sotiriades, "A distributed simulation of P systems". Preproceedings of the Workshop on Membrane Computing (A. Alhazov, C. Martin-Vide and Gh. P?un, eds); Tarragona, vol July 17-22 (2003), 455-460.
- J. Tejedor, L. Fernández, F. Arroyo, G. Bravo, An architecture for attacking the bottleneck communication in P systems. In: M. Sugisaka, H. Tanaka (eds. ), Proceedings of the 12th Int. Symposium on Artificial Life and Robotics, Jan 25-27, 2007, Beppu, Oita, Japan, 500-505.
- Fernandez, L. , Martinez, V. J. , Arroyo, F. , and Mingo,L. F. (2005). A hardware circuit for selecting active rules in transition p systems. Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Proceedings, 1:415-418.
- Martinez, V. , Arroyo, F. , Gutierrez, A. , and Fernandez, L. (2007). Hardware implementation of a bounded algorithm for application of rules in a transition p-system. SYNASC 2006: Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Proceedings, 1:343-349
- Suzuki, Y. and Tanaka, H. (2000). On a lisp implementation of a class of p systems. In Romanian Journal of Information Science and Technology, volume 3, pages 173-186.
- Arroyo, F. , Luengo, C. , Baranda, A. V. , and de Mingo, L. (2003). A software simulation of transition p systems in Haskell. Membrane Computing, 2597:19-32.
- John Hopcroft, Jeffrey Ullman, Introduction to Automata Theory, Languages, and Computation,Addison-Wesley 1979.
- Dina Goldin, Peter Wegner, Persistent Turing Machines, Brown University Technical Report, 1998.
- Peter Wegner, Dina Goldin, Coinductive Models of Finite Computing Agents, Proc. Coalgebra Workshop (CMCS '99), Electronic Notes in Theoretical Computer Science, Vol. 19, March 1999.
Index Terms
Keywords