Some Analysis on Certain Types of Splicing Systems
A mathematical model of a splicing system was firstly developed by Head in 1987. This model is abstractly analyzed in the framework of Formal Language Theory, which is a branch of Applied Discrete Mathematics and Theoretical Computer Science. This model consists of a finite set of initial strings o...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
Liverpool Hope University
2010
|
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1109/BICTA.2010.5645073 http://dx.doi.org/10.1109/BICTA.2010.5645073 http://umpir.ump.edu.my/9529/1/3.%202010-%20PI-%20Scopus-%20Some%20Analysis%20on%20Certain%20Types%20of%20Splicing%20Systems.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A mathematical model of a splicing system was firstly
developed by Head in 1987. This model is abstractly analyzed in the framework of Formal Language Theory, which is a branch of Applied Discrete Mathematics and Theoretical Computer Science. This model consists of a finite set of initial strings over an alphabet that acts upon a finite set of rules. In this paper, some analysis on certain types of splicing systems namely, nullcontext, uniform, simple and SkH system are presented as propositions and corollaries. Besides, some counterexamples are given to illustrate these relations. |
|---|