Journal ArticleDOI
On Succinct Description of Certain Context-Free Languages by Ins-Del and Matrix Ins-Del Systems
Reads0
Chats0
TLDR
It is shown that with respect to these measures, both the insertion-deletion systems are more succinct over context-free grammars in representing certain families of context- free languages.Abstract:
In this paper, we introduce some basic measures for insertion-deletion system and matrix insertion-deletion system. These measures are based on the number of variables, the number of productions and the number of symbols in a grammar. We show that with respect to these measures, both the systems are more succinct over context-free grammars in representing certain families of context-free languages.read more
Citations
More filters
On the computational power of insertion-deletion systems
TL;DR: The generative power of insertion-deletion systems (InsDel systems) is investigated, and it is shown that the family INS11DEL11 is equal to the family of recursively enumerable languages.
P Systems with Minimal Insertion and Deletion
TL;DR: In this paper, the authors considered insertion-deletion P systems with priority of deletion over insertion and showed that such systems with one-symbol context-free insertion and deletion rules are able to generate Parikh sets of all recursively enumerable languages (PsRE).
Journal ArticleDOI
Investigations on the power of matrix insertion-deletion systems with small sizes
TL;DR: This paper improves on and complement previous computational completeness results for matrix insertion-deletion systems, and generates non-semilinear languages using matrices of length three with context-free insertion and deletion rules.
Book ChapterDOI
Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion
TL;DR: This work shows for instance that matrix insertion-deletion systems with matrices of length two, insertion rules of type 1,i?ź1, i?Ż1 and context-free deletions are computationally complete and how to simulate Kleene stars of metalinear languages with several types of systems with very limited resources.
Journal ArticleDOI
On describing super-linear languages by matrix insertion–deletion systems
TL;DR: The context-free grammars that generate these super-linear languages between LIN and CFL are discussed and also simulate them by matrix ins–del systems.
References
More filters
On the computational power of insertion-deletion systems
TL;DR: The generative power of insertion-deletion systems (InsDel systems) is investigated, and it is shown that the family INS11DEL11 is equal to the family of recursively enumerable languages.
Journal ArticleDOI
P systems with minimal insertion and deletion
TL;DR: It is shown that such systems with one-symbol context-free insertion and deletion rules are able to generate Parikh sets of all recursively enumerable languages (PsRE), and that the priority relation is very important.
P Systems with Minimal Insertion and Deletion
TL;DR: In this paper, the authors considered insertion-deletion P systems with priority of deletion over insertion and showed that such systems with one-symbol context-free insertion and deletion rules are able to generate Parikh sets of all recursively enumerable languages (PsRE).
Book ChapterDOI
Matrix insertion-deletion systems for bio-molecular structures
TL;DR: This paper introduces a simple grammar system that encompasses many bio-molecular structures including the above mentioned structures and discusses how the ambiguity levels defined for insertion-deletion grammar systems can be realized in bio-numbers structures, thus the ambiguity issues in gene sequences can be studied in terms of grammar systems.
Book ChapterDOI
Insertion-Deletion P Systems
TL;DR: This paper presents a new variant of P systems with string objects having insertion-deletion rules as the control structure, and investigates the power of this type of systems with less than four membranes, in comparison with the families of CF, MAT and RE.