Contextual insertions/deletions and computability
From MaRDI portal
Recommendations
- Computational completeness of simple semi-conditional insertion-deletion systems
- Context-free insertion-deletion systems
- Universality and computational completeness of controlled leftist insertion-deletion systems
- On the computational power of insertion-deletion systems
- scientific article; zbMATH DE number 1953225
- Insertion-deletion with substitutions. II: About the role of one-sided context
- Random context and semi-conditional insertion-deletion systems
- Insertion and deletion closure of languages
- Decidability questions for insertion systems and related models
- On minimal context-free insertion-deletion systems
Cited in
(56)- On bonded sequential and parallel insertion systems
- On path-controlled insertion-deletion systems
- Cut-and-paste languages
- Computational power of insertion-deletion (P) systems with rules of size two
- P systems with minimal insertion and deletion
- On Szilard languages of InsDel systems
- Single semi-contextual insertion-deletion systems
- Computational power of intramolecular gene assembly
- Computational completeness of path-structured graph-controlled insertion-deletion systems
- Experimental efficiency of programmed mutagenesis
- Matrix insertion-deletion systems
- Using DNA to solve the bounded Post correspondence problem
- On the computing powers of \(\mathcal{L}\)-reductions of insertion languages
- Universality of graph-controlled leftist insertion-deletion systems with two states
- scientific article; zbMATH DE number 7584602 (Why is no real title available?)
- On the ambiguity of insertion systems
- Computational completeness of simple semi-conditional insertion-deletion systems of degree (2,1)
- Generative power of matrix insertion-deletion systems with context-free insertion or deletion
- On the weight of universal insertion grammars
- Parikh images of matrix ins-del systems
- Investigations on the power of matrix insertion-deletion systems with small sizes
- Universal insertion grammars of size two
- Outfix-guided insertion (extended abstract)
- On succinct description of certain context-free languages by ins-del and matrix ins-del systems
- Context-free insertion-deletion systems
- Characterizations of recursively enumerable languages by means of insertion grammars
- Circular Post machines and P systems with exo-insertion and deletion
- On the generative capacity of matrix insertion-deletion systems of small sum-norm
- On the computational completeness of graph-controlled insertion-deletion systems with binary sizes
- Evaluating space measures in P systems
- Hybrid networks of evolutionary processors are computationally complete
- On homomorphic images of the Szilard languages of matrix insertion-deletion systems with matrices of size 2
- Parallel contextual array insertion-deletion P systems and array rewriting P systems with pure 2D context-free rules
- Context insertions
- Regulated RNA rewriting: Modelling RNA editing with guided insertion
- Possibilities of constructing two dimensional pictures in DNA computing: Part I
- Random context and semi-conditional insertion-deletion systems
- Nondeterministic state complexity of site-directed deletion
- Bounded hairpin completion
- Parallel contextual array insertion deletion P systems and tabled matrix grammars
- Schema for parallel insertion and deletion: revisited
- Transposition based contextual insertion on linear DNA strands with deletion precedence
- When Stars Control a Grammar's Work
- Site-directed insertion: language equations and decision problems
- Outfix-guided insertion
- On decision problems concerning contextual insertions and deletions
- The nondeterministic state complexity of the site-directed deletion language operation
- scientific article; zbMATH DE number 7584595 (Why is no real title available?)
- REPRESENTATIONS AND CHARACTERIZATIONS OF LANGUAGES IN CHOMSKY HIERARCHY BY MEANS OF INSERTION-DELETION SYSTEMS
- Further Results on Insertion-Deletion Systems with One-Sided Contexts
- Bounded Hairpin Completion
- DNA computing, insertion of words and left-symmetric algebras
- Algorithmic applications of XPCR
- DNA computing: Arrival of biological mathematics
- Maximally parallel contextual string rewriting
- Descriptional complexity of graph-controlled insertion-deletion systems
This page was built for publication: Contextual insertions/deletions and computability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675056)
