Membrane agents simulating Boolean circuits

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F17%3AA0000067" target="_blank" >RIV/47813059:19240/17:A0000067 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.5593/sgem2017/21/S07.053" target="_blank" >http://dx.doi.org/10.5593/sgem2017/21/S07.053</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.5593/sgem2017/21/S07.053" target="_blank" >10.5593/sgem2017/21/S07.053</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Membrane agents simulating Boolean circuits

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Membrane agents simulating Boolean circuits

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/LQ1602" target="_blank" >LQ1602: IT4Innovations excellence in science</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2017

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

International Multidisciplinary Scientific GeoConference Surveying Geology and Mining Ecology Management, SGEM

ISBN

9786197408010

ISSN

1314-2704

e-ISSN

—

Počet stran výsledku

8

Strana od-do

417-424

Název nakladatele

International Multidisciplinary Scientific Geoconference

Místo vydání

Sofia

Místo konání akce

Albena; Bulgaria

Datum konání akce

1. 1. 2017

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—