A class of restricted P colonies with string environment
From MaRDI portal
Publication:2311263
DOI10.1007/s11047-016-9564-3zbMath1415.68075OpenAlexW2484073347MaRDI QIDQ2311263
Erzsébet Csuhaj-Varjú, Luděk Cienciala, Lucie Ciencialová
Publication date: 10 July 2019
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-016-9564-3
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42)
Related Items
Solving a PSPACE-complete problem by symport/antiport P systems with promoters and membrane division ⋮ Computational power of dynamic threshold neural P systems for generating string languages ⋮ Two notes on APCol systems ⋮ P colonies. Survey ⋮ Computational completeness of sequential spiking neural P systems with inhibitory rules
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Remarks on blind and partially blind one-way multicounter machines
- P colonies and prescribed teams
- P Colonies with a Bounded Number of Cells and Programs
- JUMPING FINITE AUTOMATA
- P Colonies Processing Strings
- On the Number of Agents in P Colonies
