Universality and Computational Completeness of Controlled Leftist Insertion-Deletion Systems

DOI10.3233/FI-2017-1580zbMath1378.68100OpenAlexW2754066816MaRDI QIDQ4601152

Sergiu Ivanov, Sergey Verlan

Publication date: 19 January 2018

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

Full work available at URL: https://doi.org/10.3233/fi-2017-1580

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (8)

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 ⋮ When Stars Control a Grammar's Work ⋮ Decidability Questions for Insertion Systems and Related Models

This page was built for publication: Universality and Computational Completeness of Controlled Leftist Insertion-Deletion Systems