Random Context and Semi-conditional Insertion-deletion Systems

DOI10.3233/FI-2015-1203zbMath1357.68060arXiv1112.5947OpenAlexW1940239034MaRDI QIDQ2805451

Sergiu Ivanov, Sergey Verlan

Publication date: 11 May 2016

Published in: Fundamenta Informaticae (Search for Journal in Brave)

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

zbMATH Keywords

insertion-deletion systemsrandom contextcomputational (in)completeness

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (12)

On the computational completeness of graph-controlled insertion-deletion systems with binary sizes ⋮ Universality of Graph-controlled Leftist Insertion-deletion Systems with Two States ⋮ Investigations on the power of matrix insertion-deletion systems with small sizes ⋮ On the generative capacity of matrix insertion-deletion systems of small sum-norm ⋮ Single semi-contextual insertion-deletion systems ⋮ Unnamed Item ⋮ On homomorphic images of the Szilard languages of matrix insertion-deletion systems with matrices of size 2 ⋮ Computational completeness of simple semi-conditional insertion-deletion systems of degree (2,1) ⋮ On path-controlled insertion-deletion systems ⋮ Decidability Questions for Insertion Systems and Related Models ⋮ Matrix insertion-deletion systems ⋮ Generating and accepting P systems with minimal left and right insertion and deletion

This page was built for publication: Random Context and Semi-conditional Insertion-deletion Systems