13,656 research outputs found
A Framework for Complexity Classes in Membrane Computing
The purpose of the present work is to give a general idea about the existing results and open problems
concerning the study of complexity classes within the membrane computing framework. To this aim,
membrane systems (seen as computing devices) are briefly introduced, providing the basic definition and
summarizing the key ideas, trying to cover the various approaches that are under investigation in this area
– of course, special attention is paid to the study of complexity classes. The paper concludes with some
final remarks that hint the reasons why this field (as well as other unconventional models of computation)
is attracting the attention of a growing community.Ministerio de Educación y Ciencia TIN2005-09345-C04-01Junta de Andalucía TIC-58
Computing with cells: membrane systems - some complexity issues.
Membrane computing is a branch of natural computing which abstracts computing models from the structure and the functioning of the living cell. The main ingredients of membrane systems, called P systems, are (i) the membrane structure, which consists of a hierarchical arrangements of membranes which delimit compartments where (ii) multisets of symbols, called objects, evolve according to (iii) sets of rules which are localised and associated with compartments. By using the rules in a nondeterministic/deterministic maximally parallel manner, transitions between the system configurations can be obtained. A sequence of transitions is a computation of how the system is evolving. Various ways of controlling the transfer of objects from one membrane to another and applying the rules, as well as possibilities to dissolve, divide or create membranes have been studied. Membrane systems have a great potential for implementing massively concurrent systems in an efficient way that would allow us to solve currently intractable problems once future biotechnology gives way to a practical bio-realization. In this paper we survey some interesting and fundamental complexity issues such as universality vs. nonuniversality, determinism vs. nondeterminism, membrane and alphabet size hierarchies, characterizations of context-sensitive languages and other language classes and various notions of parallelism
On acceptance conditions for membrane systems: characterisations of L and NL
In this paper we investigate the affect of various acceptance conditions on
recogniser membrane systems without dissolution. We demonstrate that two
particular acceptance conditions (one easier to program, the other easier to
prove correctness) both characterise the same complexity class, NL. We also
find that by restricting the acceptance conditions we obtain a characterisation
of L. We obtain these results by investigating the connectivity properties of
dependency graphs that model membrane system computations
A new perspective on computational complexity theory in Membrane Computing
A single Turing machine can solve decision problems with an in nite number
of instances. On the other hand, in the framework of membrane computing, a \solution"
to an abstract decision problem consists of a family of membrane systems (where each
system of the family is associated with a nite set of instances of the problem to be
solved). An interesting question is to analyze the possibility to nd a single membrane
system able to deal with the in nitely many instances of a decision problem.
In this context, it is fundamental to de ne precisely how the instances of the problem
are introduced into the system. In this paper, two different methods are considered:
pre-computed (in polynomial time) resources and non-treated resources.
An extended version of this work will be presented in the 20th International Conference
on Membrane Computing.Ministerio de Economía, Industria y Competitividad TIN2017-89842-
Introducing a Space Complexity Measure for P Systems
We define space complexity classes in the framework of membrane computing, giving some initial results about their mutual relations and their connection with time
complexity classes, and identifying some potentially interesting problems which require
further research
- …