POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Note Concerning Nondeterministic Tape Complexities
Journal of the ACM (JACM)
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
Membrane computing with external output
Fundamenta Informaticae
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
Membrane Computing: When Communication Is Enough
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Membrane Systems with Symport/Antiport Rules: Universality Results
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
P Automata or Purely Communicating Accepting P Systems
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Simulating Counter Automata by P Systems with Symport/Antiport
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
P Systems without Priorities Are Computationally Universal
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
On membrane hierarchy in P systems
Theoretical Computer Science
On the Computational Power of 1-Deterministic and Sequential P Systems
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Editing Configurations of P Systems
Fundamenta Informaticae
Membrane systems working in generating and accepting modes: expressiveness and encodings
CMC'10 Proceedings of the 11th international conference on Membrane computing
On sequential and 1-deterministic p systems
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
P systems: some recent results and research problems
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
WMC'04 Proceedings of the 5th international conference on Membrane Computing
On the computational complexity of P automata
DNA'04 Proceedings of the 10th international conference on DNA computing
From cells to computers: membrane computing – a quick overview
DNA'04 Proceedings of the 10th international conference on DNA computing
An efficient simulation of polynomial-space turing machines by p systems with active membranes
WMC'09 Proceedings of the 10th international conference on Membrane Computing
P and dp automata: unconventional versus classical automata
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Editing Configurations of P Systems
Fundamenta Informaticae
On the Computational Power of 1-Deterministic and Sequential P Systems
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Terminating population protocols via some minimal global knowledge assumptions
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Hi-index | 5.23 |
We show how techniques in machine-based complexity can be used to analyze the complexity of membrane computing systems. We focus on catalytic syslems, communicating P systems, and systems with only symport/antiport rules, but our techniques are applicable to other P systems that are universal. We define space and time complexity measures and show hierarchies of complexity classes similar to well-known results concerning Turing machines and counter machines. We also show that the deterministic communicating P system simulating a deterministic counter machine in (Sosik (2002)) (Pre-Proc. of Workshop on Membrane Computing (WMC-CdeA2002), Curtea de Arges, Romania, 2002, pp. 371-382), (Sosik and Matysek (2002)) (Unconventional Models of Computation 2002, Lecture Notes in Computer Science, vol. 2509, Springer, Berlin, 2002, pp. 264-275.) can be constructed to have a fixed number of membranes, answering positively an open question in Sosik (2002), Sosik and Matysek (2002). We prove that reachability of extended configurations for symport/antiport systems (as well as for catalytic systems and communicating P systems) can be decided in nondeterministic log n space and, hence, in deterministic log2 n space or in polynomial time, improving the main result in Paun et al. (2002) (On the reachability problem for P systems with symport/antiport, 2002, submitted for publication.), We propose two equivalent systems that define languages (instead of multisets of objects): the first is a catalytic system language generator and the other is a communicating P system acceptor (or a symport/antiport system acceptor). These devices are universal and therefore can also be analyzed with respect to space and time complexity. Finally, we give a characterization of semilinear languages in terms of a restricted form of catalytic system language generator.