Can I read P Systems with Minimal Insertion and Deletion on EtoBox?

P Systems with Minimal Insertion and Deletion by Artiom Alhazov; Alexander Krassovitskiy; Yurii Rogozhin; Sergey Verlan is a Computer Science article available to read on EtoBox.

What is P Systems with Minimal Insertion and Deletion about?

In this paper, we consider insertion-deletion P systems with priority of deletion over insertion. We show that such systems with one-symbol context-free insertion and deletion rules are able to generate Parikh sets of all recursively enumerable languages (PsRE). If a one-symbol one-sided context is added to the insertion or deletion rules, then all recursively enumerable languages can be generated. The same result holds if a deletion of two symbols is permitted. We also show that the priority relation is very important, and in its absence the corresponding class of P systems is strictly included in the family of matrix languages (MAT ).

Who reads P Systems with Minimal Insertion and Deletion?

Author

Artiom Alhazov; Alexander Krassovitskiy; Yurii Rogozhin; Sergey Verlan

Publisher

Elsevier Science; Elsevier ; Elsevier BV (ISSN 0304-3975)

Published

2011

Language

EN

Field

Computer Science (Physical Sciences)