Generating and accepting P systems with minimal left and right insertion and deletion

DOI10.1007/s11047-013-9396-3zbMath1332.68048OpenAlexW2010644121MaRDI QIDQ256963

Yurii Rogozhin, Sergey Verlan, Rudolf Freund

Publication date: 14 March 2016

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-013-9396-3

zbMATH Keywords

P systemscomputational completenessdeletioninsertionmatrix grammars

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42)

Related Items

Insertion-deletion systems with substitutions I ⋮ Unnamed Item ⋮ Tissue P Systems with Vesicles of Multisets ⋮ Unnamed Item ⋮ Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors ⋮ Variants of Networks of Evolutionary Processors with Polarizations and a Small Number of Processors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational power of insertion-deletion (P) systems with rules of size two
• P systems with minimal insertion and deletion
• Recent developments on insertion-deletion systems
• Matrix insertion-deletion systems
• Insertion languages
• Context-free insertion-deletion systems
• Membrane computing. An introduction.
• Regulated RNA rewriting: Modelling RNA editing with guided insertion
• Random Context and Semi-conditional Insertion-deletion Systems
• Circular Post Machines and P Systems with Exo-insertion and Deletion
• On Normal Forms for Networks of Evolutionary Processors
• P Systems with Insertion and Deletion Exo-Operations
• P Systems with Minimal Left and Right Insertion and Deletion
• DNA Computing
• Formal Reductions of the General Combinatorial Decision Problem