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
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Mathematical Theory of L Systems
Mathematical Theory of L Systems
On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
| Hi-index | 0.00 |
In this paper, we continue the study of tissue Psystems (tP systems) recently introduced by C. Martin Vide et.al in [5]. We consider here only tP systems working in the minimal mode. All the results in this paper are solutions to some of the open problems listed in [5] with respect to tP systems working in the minimal mode. We obtain two characterizations of recursively enumerable languages: tP systems having 2 cells and 3 states as well as tP systems having 4 cells and 2 states generate PsRE. We also show that 2 cells and 2 states are sufficient for generating E0L languages, whereas 3 cells and 2 states are sufficient for generating ET0L languages.