Handbook of formal languages, vol. 3: beyond words
Handbook of formal languages, vol. 3: beyond words
Journal of Computer and System Sciences
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Membrane Computing: An Introduction
Membrane Computing: An Introduction
P Systems with Proteins on Membranes
Fundamenta Informaticae
Membrane Systems with Marked Membranes
Electronic Notes in Theoretical Computer Science (ENTCS)
Membrane systems with limited parallelism
Membrane systems with limited parallelism
P finite automata and regular languages over countably infinite alphabets
WMC'06 Proceedings of the 7th international conference on Membrane Computing
On the computational complexity of P automata
DNA'04 Proceedings of the 10th international conference on DNA computing
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
P systems with proteins on membranes and membrane division
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
P automata: concepts, results, and new aspects
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
Hi-index | 5.23 |
We introduce the notion of a P automaton with marked membranes, a P"p"p automaton for short, which is an accepting variant of P systems. The concept is motivated by the theory of P systems, brane calculi, and the traditional concept of automata. In P systems with marked membranes, bio-molecules (proteins) are allowed to move through the membranes and to attach onto or to de-attach from the membranes. The membrane system evolves according to rules which are defined over multisets of proteins and describe the above actions. In addition to these features, the P automaton with marked membranes is able to consume inputs from its environment, i.e. multisets of proteins, which might influence the behaviour of the system. The result of the computation is the set of multiset sequences consumed by the skin membrane, supposing that the P"p"p automaton started functioning in the initial configuration and entered a final configuration at halting. We show that any recursively enumerable language can be obtained as the language accepted by a P"p"p automaton modulo a simple computable mapping.