Computational power of P systems with small size insertion and deletion rules
From MaRDI portal
Publication:5145153
zbMATH Open1455.68060arXiv0906.3119MaRDI QIDQ5145153FDOQ5145153
Authors: Alexander Krassovitskiy, Yurii Rogozhin, Sergey Verlan 
Publication date: 20 January 2021
Full work available at URL: https://arxiv.org/abs/0906.3119
Recommendations
- Computational power of insertion-deletion (P) systems with rules of size two
- P systems with insertion and deletion exo-operations
- About one-sided one-symbol insertion-deletion P systems
- P systems with minimal insertion and deletion
- Computational completeness of simple semi-conditional insertion-deletion systems
Formal languages and automata (68Q45) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Cited In (10)
- Computational power of insertion-deletion (P) systems with rules of size two
- P systems with minimal insertion and deletion
- Matrix insertion-deletion systems
- Computational completeness of simple semi-conditional insertion-deletion systems of degree (2,1)
- Computational completeness of simple semi-conditional insertion-deletion systems
- Power and size of extended Watson-Crick \(L\) systems.
- P systems with insertion and deletion exo-operations
- Title not available (Why is that?)
- P systems based on tag operations
- On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes
This page was built for publication: Computational power of P systems with small size insertion and deletion rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145153)
