Circular Post Machines and P Systems with Exo-insertion and Deletion
From MaRDI portal
Publication:2890284
DOI10.1007/978-3-642-28024-5_7zbMATH Open1350.68100OpenAlexW1449301793MaRDI QIDQ2890284
Artiom Alhazov, Yurii Rogozhin, Alexander Krassovitskiy
Publication date: 8 June 2012
Published in: Membrane Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-28024-5_7
Cites Work
- Computational power of insertion-deletion (P) systems with rules of size two
- P systems with minimal insertion and deletion
- Contextual insertions/deletions and computability
- Characterizations of recursively enumerable languages by means of insertion grammars
- Context-free insertion-deletion systems
- Computational power of two stacks with restricted communication
- Membrane computing. 10th international workshop, WMC 2009, Curtea de Arges, Romania, August 24--27, 2009. Revised selected and invited papers
- Computing with Cells
- P Systems with Insertion and Deletion Exo-Operations
- Further Results on Insertion-Deletion Systems with One-Sided Contexts
- Insertion-Deletion Systems with One-Sided Contexts
- Small universal circular Post machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Related Items (4)
Title not available (Why is that?) ⋮ 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 ⋮ Generating and accepting P systems with minimal left and right insertion and deletion
This page was built for publication: Circular Post Machines and P Systems with Exo-insertion and Deletion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890284)
