Small (purely) catalytic P systems simulating register machines

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F47813059%3A19240%2F15%3A%230005527" target="_blank" >RIV/47813059:19240/15:#0005527 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/47813059:19240/16:N0000068

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Small (purely) catalytic P systems simulating register machines

Popis výsledku v původním jazyce

The paper contributes to the topic of (purely) catalytic P systems. Catalytic P systems represent the original and likely the simplest class of membrane computing models. It is known that (purely) catalytic P systems with two (respectively three) catalysts and one membrane can simulate any Minsky register machine and, hence, they are computationally complete. However, the problem of minimal size of such a universal catalytic P system remains open for about ten years. We improve known results about smallcatalytic P systems simulating register machines in three different modes (generating, accepting, computing functions). Together with some specific universal register machine [7], one could eventually construct a small universal catalytic P system. As aconsequence, we also improve the previous construction of a minimal catalytic P system generating a non-semilinear set, diminishing the number of necessary rules from 29 to 24.

Název v anglickém jazyce

Small (purely) catalytic P systems simulating register machines

Popis výsledku anglicky

The paper contributes to the topic of (purely) catalytic P systems. Catalytic P systems represent the original and likely the simplest class of membrane computing models. It is known that (purely) catalytic P systems with two (respectively three) catalysts and one membrane can simulate any Minsky register machine and, hence, they are computationally complete. However, the problem of minimal size of such a universal catalytic P system remains open for about ten years. We improve known results about smallcatalytic P systems simulating register machines in three different modes (generating, accepting, computing functions). Together with some specific universal register machine [7], one could eventually construct a small universal catalytic P system. As aconsequence, we also improve the previous construction of a minimal catalytic P system generating a non-semilinear set, diminishing the number of necessary rules from 29 to 24.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

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í

2015

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 periodika

Theoretical Computer Science

ISSN

0304-3975

e-ISSN

—

Svazek periodika

623

Číslo periodika v rámci svazku

2016

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

10

Strana od-do

65-74

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—