scientific article; zbMATH DE number 7584595
From MaRDI portal
Publication:5867515
Sergey Verlan, Sergiu Ivanov, Artiom Alhazov, Rudolf Freund
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
regulated rewritingcooperating distributed grammar systemmatrix grammarinsertion-deletiongraph-controlled grammartime-varying grammar
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating and accepting P systems with minimal left and right insertion and deletion
- Computational power of insertion-deletion (P) systems with rules of size two
- P systems with minimal insertion and deletion
- Recent developments on insertion-deletion systems
- Contextual insertions/deletions and computability
- Matrix insertion-deletion systems
- Insertion languages
- Adding matrix control: insertion-deletion systems with substitutions. III
- On the computational power of insertion-deletion systems
- Insertion-deletion systems over relational words
- Context-free insertion-deletion systems
- Computational completeness of simple semi-conditional insertion-deletion systems
- Hybrid modes in cooperating distributed grammar systems: Combining the \(t\)-mode with the modes \(\leqslant k\) and \(=k\)
- 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
- The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems
- Random Context and Semi-conditional Insertion-deletion Systems
- Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion
- A General Framework for Regulated Rewriting Based on the Applicability of Rules
- On the decidability of accessibility problems (extended abstract)
- 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
- Normal forms for phrase-structure grammars
- On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems
- Universality and Computational Completeness of Controlled Leftist Insertion-Deletion Systems
- Relations between Control Mechanisms for Sequential Grammars1
- Hybrid modes in cooperating distributed grammar systems: Internal versus external hybridization
This page was built for publication:
