Universality and computational completeness of controlled leftist insertion-deletion systems

DOI10.3233/FI-2017-1580zbMATH Open1378.68100OpenAlexW2754066816MaRDI QIDQ4601152FDOQ4601152

Authors: 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

Recommendations

• Universality of graph-controlled leftist insertion-deletion systems with two states
• Graph-controlled insertion-deletion systems
• Further Results on Insertion-Deletion Systems with One-Sided Contexts
• Random context and semi-conditional insertion-deletion systems
• Insertion-Deletion Systems with One-Sided Contexts

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (10)

• Single semi-contextual insertion-deletion systems
• Contextual insertions/deletions and computability
• 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
• Universality of Graph-controlled Leftist Insertion-deletion Systems with Two States
• On the computational completeness of graph-controlled insertion-deletion systems with binary sizes
• On homomorphic images of the Szilard languages of matrix insertion-deletion systems with matrices of size 2
• When Stars Control a Grammar's Work
• Title not available (Why is that?)
• Decidability Questions for Insertion Systems and Related Models

This page was built for publication: Universality and computational completeness of controlled leftist insertion-deletion systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4601152)