Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion
From MaRDI portal
Publication:2819137
DOI10.1007/978-3-319-41312-9_4zbMath1410.68183OpenAlexW2503219481MaRDI QIDQ2819137
Indhumathi Raman, Henning Fernau, Lakshmanan Kuppusamy
Publication date: 28 September 2016
Published in: Unconventional Computation and Natural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-41312-9_4
Related Items (6)
On the computational completeness of graph-controlled insertion-deletion systems with binary sizes ⋮ Investigations on the power of matrix insertion-deletion systems with small sizes ⋮ 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 ⋮ Parikh Images of Matrix Ins-Del Systems
Cites Work
- P systems with minimal insertion and deletion
- Recent developments on insertion-deletion systems
- Contextual insertions/deletions and computability
- Matrix insertion-deletion systems
- On the reachability problem for 5-dimensional vector addition systems
- Characterizations of recursively enumerable languages by means of insertion grammars
- Nonterminal complexity of programmed grammars.
- Context-free insertion-deletion systems
- Regulated RNA rewriting: Modelling RNA editing with guided insertion
- Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems
- Universality of Graph-controlled Leftist Insertion-deletion Systems with Two States
- On Succinct Description of Certain Context-Free Languages by Ins-Del and Matrix Ins-Del Systems
- Parikh Images of Matrix Ins-Del Systems
- One-sided and two-sided context in formal grammars
- On Context-Free Languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion
