Journal of Computer and System Sciences
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Theoretical Computer Science - Natural computing
Membrane systems with coupled transport: universality and normal forms
Fundamenta Informaticae - Membrane computing
The power of communication: P systems with symport/antiport
New Generation Computing
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
Carriers and counters: P systems with carriers vs. (blind) counter automata
DLT'02 Proceedings of the 6th international conference on Developments in language theory
P Systems with Activated/Prohibited Membrane Channels
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Membrane Systems with Symport/Antiport Rules: Universality Results
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Molecular Biology of Bacteria and Its Relevance for P Systems
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Evolution-Communication P Systems
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Unexpected Universality Results for Three Classes of P Systems with Symport/Antiport
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Unexpected universality results for three classes of P systems with symport/antiport
Natural Computing: an international journal
Catalytic P systems, semilinear sets, and vector addition systems
Theoretical Computer Science
On the computational complexity of membrane systems
Theoretical Computer Science
Tissue P systems with channel states
Theoretical Computer Science - Insightful theory
P systems with conditional communication rules assigned to membranes
Journal of Automata, Languages and Combinatorics
New Generation Computing
Theoretical Computer Science
On small universal antiport P systems
Theoretical Computer Science
A Linear--time Tissue P System Based Solution for the 3--coloring Problem
Electronic Notes in Theoretical Computer Science (ENTCS)
Carriers and counters: P systems with carriers vs. (blind) counter automata
DLT'02 Proceedings of the 6th international conference on Developments in language theory
On three classes of automata-like P systems
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Skin output in P systems with minimal symport/antiport and two membranes
WMC'07 Proceedings of the 8th international conference on Membrane computing
Towards a characterization of p systems with minimal symport/antiport and two membranes
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Counting time in computing with cells
DNA'05 Proceedings of the 11th international conference on DNA Computing
Computational power of symport/antiport: history, advances, and open problems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
P systems, petri nets, and program machines
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Tissue p systems with antiport rules and small numbers of symbols and cells
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Communicative p systems with minimal cooperation
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Tissue p systems with minimal symport/antiport
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Characterizing tractability by tissue-like p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
| Hi-index | 0.01 |
The complexity, expressed in number of membranes and weight of rules, of P systems with symport/antiport generating recursively enumerable sets is reduced if counter automata instead of matrix grammars are simulated. We consider both subsets of N obtained by counting objects in a designated membrane, and string languages obtained by following the traces of a designated object.