Journal of Computer and System Sciences
Handbook of Formal Languages
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Theoretical Computer Science - Natural computing
On the computational complexity of membrane systems
Theoretical Computer Science
Minimizing evolution-communication P systems and automata
New Generation Computing - Membrane computing
Computationally universal P systems without priorities: two catalysts are sufficient
Theoretical Computer Science - Descriptional complexity of formal systems
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
Regular ω-Languages Defined by Finite Extended Spiking Neural P Systems
Fundamenta Informaticae
A general approach for building combinational P automata
International Journal of Computer Mathematics
P Automata: Membrane Systems as Acceptors
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Rainbow of computer science
On the parallelizability of languages accepted by P automata
Computation, cooperation, and life
P machines: an automata approach to membrane computing
WMC'06 Proceedings of the 7th international conference on Membrane Computing
P finite automata and regular languages over countably infinite alphabets
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Computational completeness of tissue p systems with conditional uniport
WMC'06 Proceedings of the 7th international conference on Membrane Computing
WMC'04 Proceedings of the 5th international conference on Membrane Computing
A p system description of the sodium-potassium pump
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
P automata: concepts, results, and new aspects
WMC'09 Proceedings of the 10th international conference on Membrane Computing
An infinite hierarchy of languages defined by dP systems
Theoretical Computer Science
Variants of distributed p automata and the efficient parallelizability of languages
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Finite dp automata versus multi-head finite automata
CMC'11 Proceedings of the 12th 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
Regular ω-Languages Defined by Finite Extended Spiking Neural P Systems
Fundamenta Informaticae
On the properties of language classes defined by bounded reaction automata
Theoretical Computer Science
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper we introduce the notion of a Pautomaton with one-way communication, a concept related both to Psystems and the traditional concept of automata. A Pautomaton with one-way communication is a purely communicating accepting P system. The result of the computation in these systems is the set of multiset sequences consumed by the skin membrane, supposing that the Pautomaton started functioning in an initial state and entered a so-called final state. As a result, we show that for any recursively enumerable language, a Pautomaton and a certain type of projection can be constructed such that the given language is obtained as the image of the set of accepted input multiset sequences of the Pautomaton.