| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 1069 8 |
| Ultima descărcare din IBN: 2021-08-14 16:08 |
| Căutarea după subiecte similare conform CZU |
| 519.6 (125) |
| Matematică computațională. Analiză numerică. Programarea calculatoarelor (124) |
 SM ISO690:2012ALHAZOV, Artiom, FREUND, Rudolf, SOSIK, Petr. Small P Systems with Catalysts or Anti-Matter Simulating Generalized Register Machines and Generalized Counter Automata. In: Computer Science Journal of Moldova, 2015, nr. 3(69), pp. 304-328. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Computer Science Journal of Moldova |
||||||
| Numărul 3(69) / 2015 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 519.6 | ||||||
| Pag. 304-328 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
In this paper we focus on two weak forms of cooperation in P systems, namely, catalytic rules and matter/anti-matter annihilation rules. These variants of P systems both are computationally complete, while the corresponding rule complexity turns out to be of special interest. For establishing considerably small universal P systems in both cases, we found two suitable tools: generalized register machines and generalized counter automata. Depending on the features used in the different variants, we construct several small universal P systems. |
||||||
|
Dublin Core Export
<?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'> <dc:creator>Alhazov, A.E.</dc:creator> <dc:creator>Freund, R.</dc:creator> <dc:creator>Sosik, P.</dc:creator> <dc:date>2015-11-24</dc:date> <dc:description xml:lang='en'>In this paper we focus on two weak forms of cooperation in P systems, namely, catalytic rules and matter/anti-matter annihilation rules. These variants of P systems both are computationally complete, while the corresponding rule complexity turns out to be of special interest. For establishing considerably small universal P systems in both cases, we found two suitable tools: generalized register machines and generalized counter automata. Depending on the features used in the different variants, we construct several small universal P systems. </dc:description> <dc:source>Computer Science Journal of Moldova 69 (3) 304-328</dc:source> <dc:title>Small P Systems with Catalysts or Anti-Matter Simulating Generalized Register Machines and Generalized Counter Automata</dc:title> <dc:type>info:eu-repo/semantics/article</dc:type> </oai_dc:dc>
|
|
|
