Handbook of formal languages, vol. 3: beyond words
Handbook of formal languages, vol. 3: beyond words
Journal of Computer and System Sciences
Computing with cells and atoms: an introduction to quantum, DNA and membrane computing
Computing with cells and atoms: an introduction to quantum, DNA and membrane computing
Marcus Contextual Grammars
Mathematical Theory of L Systems
Mathematical Theory of L Systems
A Linear--time Tissue P System Based Solution for the 3--coloring Problem
Electronic Notes in Theoretical Computer Science (ENTCS)
A uniform family of tissue P systems with cell division solving 3-COL in a linear time
Theoretical Computer Science
Solving the Independent Set Problem by Using Tissue-Like P Systems with Cell Division
IWINAC '09 Proceedings of the 3rd International Work-Conference on The Interplay Between Natural and Artificial Computation: Part I: Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira's Scientific Legacy
Computational complexity of tissue-like P systems
Journal of Complexity
Tissue p systems with cell separation: upper bound by PSPACE
TPNC'12 Proceedings of the First international conference on Theory and Practice of Natural Computing
The efficiency of tissue p systems with cell separation relies on the environment
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Limits of the power of tissue p systems with cell division
CMC'12 Proceedings of the 13th international conference on Membrane Computing
| Hi-index | 0.00 |
The study of tissue P systems was initiated in [6], inspired from the way neurons cooperate, processing impulses in the complex net established by synapses. These systems use multisets of objects for processing, and it was shown that computational completeness can be achieved using a small number of cells and states. In this paper, we use string objects as the underlying data structure. The control structure used is a restricted form of contextual rules and rewriting rules. We obtain two characterizations of recursively enumerable languages using these systems: tP systems having 2 states and 2 cells as well as tP systems having 4 states and a single cell generate all recursively enumerable languages. We also discuss the relationships with ETOL and EOL languages.