Regulated insertion-deletion systems

MaRDI QIDQ5867515FDOQ5867515

Authors: Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Sergey Verlan 

Publication date: 14 September 2022

Full work available at URL: http://www.jalc.de/issues/2022/issue_27_1-3/jalc-2022-015-045.php

Recommendations

• Small size insertion and deletion systems
• Recent developments on insertion-deletion systems
• On the computational power of insertion-deletion systems
• scientific article; zbMATH DE number 1953225
• Insertion-deletion systems with substitutions. I

zbMATH Keywords

regulated rewritingcooperating distributed grammar systemmatrix grammarinsertion-deletiongraph-controlled grammartime-varying grammar

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Context-free insertion-deletion systems
• Generating and accepting P systems with minimal left and right insertion and deletion
• Random context and semi-conditional insertion-deletion systems
• Normal forms for phrase-structure grammars
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph-controlled insertion-deletion systems
• Computational power of insertion-deletion (P) systems with rules of size two
• Title not available (Why is that?)
• P systems with minimal insertion and deletion
• Recent developments on insertion-deletion systems
• Matrix insertion-deletion systems
• Insertion languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hybrid modes in cooperating distributed grammar systems: Internal versus external hybridization
• Monotonicity of restarting automata
• On the computational power of insertion-deletion systems
• On minimal context-free insertion-deletion systems
• REPRESENTATIONS AND CHARACTERIZATIONS OF LANGUAGES IN CHOMSKY HIERARCHY BY MEANS OF INSERTION-DELETION SYSTEMS
• Further Results on Insertion-Deletion Systems with One-Sided Contexts
• Insertion-Deletion Systems with One-Sided Contexts
• Contextual insertions/deletions and computability
• Insertion-deletion systems over relational words
• Computational completeness of simple semi-conditional insertion-deletion systems
• Universality and computational completeness of controlled leftist insertion-deletion systems
• Adding matrix control: insertion-deletion systems with substitutions. III
• Universal insertion grammars of size two
• On the power of generalized forbidding insertion-deletion systems
• A general framework for sequential grammars with control mechanisms
• Universal matrix insertion grammars with small size
• Title not available (Why is that?)
• On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems
• Cooperating distributed grammar systems of finite index working in hybrid modes
• Hybrid modes in cooperating distributed grammar systems: Combining the \(t\)-mode with the modes \(\leqslant k\) and \(=k\)
• On the decidability of accessibility problems (extended abstract)
• A general framework for regulated rewriting based on the applicability of rules
• Generative power of matrix insertion-deletion systems with context-free insertion or deletion
• The finite index restriction meets hybrid modes in cooperating distributed grammar systems
• Relations between Control Mechanisms for Sequential Grammars1

Cited In (2)

• Regulated RNA rewriting: Modelling RNA editing with guided insertion
• When Stars Control a Grammar's Work

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)