Scholarly record
MEMBRANE AGENTS SIMULATING BOOLEAN CIRCUITS
Abstract
P systems are powerful computational devices, whose structure and functionality are inspired by living cells and organisms. P colonies are one of the types of P systems working with objects. They are formed from one-membrane agents placed in the shared environment and they use very simple rules. It was proved that P colonies are computationally complete devices. In the paper, we investigate the application of P colonies to simulate logical operators. It is obtained in a constructive way. In the first steps we show the construction of P colonies that can simulate the functioning of the logic gates пїЅ NOT, AND, OR, XOR, NOR and NAND, in the second step we show how to combine them to obtain Boolean circuits. These results demonstrate the method of logic circuits construction that work in a maximally parallel manner with extremely simple particles - membrane agents. In the work, we also discuss using different types of P colonies (restricted, homogeneous and 2D P colonies) for simulation of such circuits.
Publication Impact Profile
Publication details
References0
Structured references will appear here after the reference import pass. The count is preserved now so the scholarly record is not incomplete.
View or Download full articleAccess options
SWS access login
Login as SWS Scientific CommitteeLogin as SWS Scientific PartnerLogin as SWS AuthorAuthors and approved SWS contributors will read and export their own linked papers after identity matching by SWS profile, email and SGEM GlobalID.
For librarian assistance: [email protected]
Purchase Instant Access
- Article can be downloaded after successful payment.
- Article may be used according to SWS library access terms.
- Article cannot be redistributed.

