Journal of Computer and System Sciences
P systems with active membranes: attacking NP-complete problems
Journal of Automata, Languages and Combinatorics
Handbook of Formal Languages
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Membrane Computing: An Introduction
Membrane Computing: An Introduction
GP Systems with forbidding context
Fundamenta Informaticae - Membrane computing
On P Systems with Active Membranes
UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
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
From regulated rewriting to computing with membranes: collapsing hierarchies
Theoretical Computer Science
P systems with active membranes and without polarizations
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Computation: finite and infinite machines
Computation: finite and infinite machines
Translating Multiset Tree Automata into P Systems
Membrane Computing
Characterizing membrane structures through multiset tree automata
WMC'07 Proceedings of the 8th international conference on Membrane computing
Membrane computing as a modeling framework: cellular systems case studies
SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
Identifying p rules from membrane structures with an error-correcting approach
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Editing distances between membrane structures
WMC'05 Proceedings of the 6th international conference on Membrane Computing
| Hi-index | 0.00 |
We consider P systems with active membranes, but without polarizations, yet with using membrane division and membrane generation, but as the result of a halting computation we do not take the terminal string generated in a designated output membrane, instead we consider the resulting tree representing the membrane structure of the final configuration as its result. We show that each recursively enumerable tree language can be obtained in that way generated by P systems with active membranes working on strings.