Regulated insertion-deletion systems
From MaRDI portal
Recommendations
Cites work
- A general framework for regulated rewriting based on the applicability of rules
- A general framework for sequential grammars with control mechanisms
- Adding matrix control: insertion-deletion systems with substitutions. III
- Computational completeness of simple semi-conditional insertion-deletion systems
- Computational power of insertion-deletion (P) systems with rules of size two
- Context-free insertion-deletion systems
- Contextual insertions/deletions and computability
- Cooperating distributed grammar systems of finite index working in hybrid modes
- Further Results on Insertion-Deletion Systems with One-Sided Contexts
- Generating and accepting P systems with minimal left and right insertion and deletion
- Generative power of matrix insertion-deletion systems with context-free insertion or deletion
- Graph-controlled insertion-deletion systems
- scientific article; zbMATH DE number 193524 (Why is no real title available?)
- scientific article; zbMATH DE number 1236223 (Why is no real title available?)
- scientific article; zbMATH DE number 1342113 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 745858 (Why is no real title available?)
- scientific article; zbMATH DE number 1860699 (Why is no real title available?)
- scientific article; zbMATH DE number 3307580 (Why is no real title available?)
- Hybrid modes in cooperating distributed grammar systems: Combining the \(t\)-mode with the modes \(\leqslant k\) and \(=k\)
- Hybrid modes in cooperating distributed grammar systems: Internal versus external hybridization
- Insertion languages
- Insertion-deletion systems over relational words
- Insertion-Deletion Systems with One-Sided Contexts
- Matrix insertion-deletion systems
- Monotonicity of restarting automata
- Normal forms for phrase-structure grammars
- On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems
- On minimal context-free insertion-deletion systems
- On the computational power of insertion-deletion systems
- On the decidability of accessibility problems (extended abstract)
- On the power of generalized forbidding insertion-deletion systems
- P systems with minimal insertion and deletion
- Random context and semi-conditional insertion-deletion systems
- Recent developments on insertion-deletion systems
- Relations between Control Mechanisms for Sequential Grammars1
- REPRESENTATIONS AND CHARACTERIZATIONS OF LANGUAGES IN CHOMSKY HIERARCHY BY MEANS OF INSERTION-DELETION SYSTEMS
- The finite index restriction meets hybrid modes in cooperating distributed grammar systems
- Universal insertion grammars of size two
- Universal matrix insertion grammars with small size
- Universality and computational completeness of controlled leftist insertion-deletion systems
Cited in
(5)- Regulated RNA rewriting: Modelling RNA editing with guided insertion
- When Stars Control a Grammar's Work
- Space separating special Geffert normal form for succinct representation of star-controlled insertion-deletion systems
- Subregularly controlled insertion systems
- On time-varying insertion-deletion systems
This page was built for publication: Regulated insertion-deletion systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5867515)
