Computational power of P systems with small size insertion and deletion rules

MaRDI QIDQ5145153zbMATHFDO

Authors Alexander Krassovitskiy, Yurii Rogozhin, Sergey Verlan

Publication date 20 January 2021

Full work available at URL https://arxiv.org/abs/0906.3119

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

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

Cited in

(10)

• Computational completeness of simple semi-conditional insertion-deletion systems of degree (2,1)
• P systems with minimal insertion and deletion
• P systems based on tag operations
• Power and size of extended Watson-Crick \(L\) systems.
• On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes
• scientific article; zbMATH DE number 1953225 (Why is no real title available?)
• Computational completeness of simple semi-conditional insertion-deletion systems
• P systems with insertion and deletion exo-operations
• Computational power of insertion-deletion (P) systems with rules of size two
• Matrix insertion-deletion systems

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)