Computational power of weighted splicing systems
A weighted splicing system is a restriction of splicing systems in which weights are associated with the axioms, and the weight of a string z generated from two strings x and y is computed from the weights of x and y according to some operations defined on the weights. In this paper we study the com...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
Bulgarian Academy of Sciences
2014
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/37059/ http://irep.iium.edu.my/37059/ http://irep.iium.edu.my/37059/1/COMPUTATIONAL_POWER_OF_WEIGHTED_SPLICING_SYSTEMS_Comptes_Rendus_Acad_Bulgare_SCi_%282014%29.pdf http://irep.iium.edu.my/37059/4/37059_Computational%20power%20of%20weighted%20splicing%20systems_SCOPUS.pdf |
| Summary: | A weighted splicing system is a restriction of splicing systems in which weights are associated with the axioms, and the weight of a string z generated from two strings x and y is computed from the weights of x and y according to some operations defined on the weights. In this paper we study the computational power of weighted splicing systems considering different weighting spaces and cut-points. We also investigate the relationships of different variants of weighted splicing systems. |
|---|