RO EN
P systems based on tag operations
Authors: Rogojin Iurie, Verlan Serghei
– 0.16 Mb
Abstract
In this article we introduce P systems using Post's tag operation on strings. We show that the computational completeness can be achieved even if the deletion length is equal to one.Yu. Rogozhin (1}, S. Verlan (2,1}
1Institute of Mathematics and Computer Science
Academy of Sciences of Moldova
5 Academiei str., Chişinău, MD-2028, Moldova
2LACL, Departement Informatique
UFR Sciences et Technologie
Universite Paris Est - Créteil Val de Marne
61, av. Général de Gaulle
94010 Creteil, France
E-mail: dr. hab. Yurii Rogozhin: , dr. hab. Sergey Verlan:
1Institute of Mathematics and Computer Science
Academy of Sciences of Moldova
5 Academiei str., Chişinău, MD-2028, Moldova
2LACL, Departement Informatique
UFR Sciences et Technologie
Universite Paris Est - Créteil Val de Marne
61, av. Général de Gaulle
94010 Creteil, France
E-mail: dr. hab. Yurii Rogozhin: , dr. hab. Sergey Verlan:
Fulltext
– 0.16 Mb
Contents
- Toward the Soundness of Sense Structure Definitions in Thesaurus-Dictionaries. Parsing Problems and Solutions*
- Gröbner Basis Approach to Some Combinatorial Problems
- References and arrow notation instead of join operation in query languages
- Basics of Intensionalized Data: Presets, Sets, and Nominats
- P systems based on tag operations
- Static and Dynamic Membrane Structures
- Abstracts of Doctor Habilitatus Thesis
