About One-Sided One-Symbol Insertion-Deletion P Systems

DOI10.1007/978-3-642-54239-8_16zbMath1407.68172OpenAlexW148204481MaRDI QIDQ5404854

Sergiu Ivanov, Sergey Verlan

Publication date: 28 March 2014

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

Full work available at URL: https://doi.org/10.1007/978-3-642-54239-8_16

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (7)

On the computational completeness of graph-controlled insertion-deletion systems with binary sizes ⋮ Computational completeness of path-structured graph-controlled insertion-deletion systems ⋮ Universality of Graph-controlled Leftist Insertion-deletion Systems with Two States ⋮ Single semi-contextual insertion-deletion systems ⋮ When Stars Control a Grammar's Work ⋮ On path-controlled insertion-deletion systems ⋮ Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems

This page was built for publication: About One-Sided One-Symbol Insertion-Deletion P Systems