Recent developments on insertion-deletion systems
From MaRDI portal
Publication:652892
zbMath1232.68088MaRDI QIDQ652892
Publication date: 5 January 2012
Published in: Computer Science Journal of Moldova (Search for Journal in Brave)
Related Items (24)
On the computational completeness of graph-controlled insertion-deletion systems with binary sizes ⋮ Insertion-deletion systems with substitutions I ⋮ Adding matrix control: insertion-deletion systems with substitutions. III ⋮ Parsimonious computational completeness ⋮ On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems ⋮ Computational completeness of path-structured graph-controlled insertion-deletion systems ⋮ \(\mathcal{L}\)-reduction computation revisited ⋮ 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) ⋮ Unnamed Item ⋮ When Stars Control a Grammar's Work ⋮ Unnamed Item ⋮ On path-controlled insertion-deletion systems ⋮ Parikh Images of Matrix Ins-Del Systems ⋮ On Basic Properties of Jumping Finite Automata ⋮ Universal insertion grammars of size two ⋮ Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion ⋮ Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems ⋮ Insertion-deletion systems with substitutions. I ⋮ Generating and accepting P systems with minimal left and right insertion and deletion
This page was built for publication: Recent developments on insertion-deletion systems
