Context-free insertion-deletion systems
From MaRDI portal
Publication:1763721
DOI10.1016/J.TCS.2004.06.031zbMath1078.68064OpenAlexW2011023206MaRDI QIDQ1763721
Sergey Verlan, Maurice Margenstern, Gheorghe Păun, Yurii Rogozhin
Publication date: 22 February 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.06.031
Related Items (33)
On the computational completeness of graph-controlled insertion-deletion systems with binary sizes ⋮ Insertion-deletion systems with substitutions I ⋮ Circular Post Machines and P Systems with Exo-insertion and Deletion ⋮ Parsimonious computational completeness ⋮ On the number of nodes in universal networks of evolutionary processors ⋮ \(\mathcal{L}\)-reduction computation revisited ⋮ Outfix-guided insertion ⋮ P systems with minimal insertion and deletion ⋮ 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 ⋮ Unnamed Item ⋮ State Complexity of Insertion ⋮ REPRESENTATIONS AND CHARACTERIZATIONS OF LANGUAGES IN CHOMSKY HIERARCHY BY MEANS OF INSERTION-DELETION SYSTEMS ⋮ Unnamed Item ⋮ On path-controlled insertion-deletion systems ⋮ On the weight of universal insertion grammars ⋮ Parikh Images of Matrix Ins-Del Systems ⋮ Further Results on Insertion-Deletion Systems with One-Sided Contexts ⋮ On the computing powers of \(\mathcal{L}\)-reductions of insertion languages ⋮ Universal insertion grammars of size two ⋮ Morphic characterizations of languages in Chomsky hierarchy with insertion and locality ⋮ Computational power of insertion-deletion (P) systems with rules of size two ⋮ Matrix insertion-deletion systems ⋮ New Morphic Characterizations of Languages in Chomsky Hierarchy Using Insertion and Locality ⋮ MORPHIC CHARACTERIZATIONS OF LANGUAGE FAMILIES IN TERMS OF INSERTION SYSTEMS AND STAR LANGUAGES ⋮ Outfix-Guided Insertion ⋮ 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
Cites Work
This page was built for publication: Context-free insertion-deletion systems
