Computer Science – Formal Languages and Automata Theory
Scientific paper
2010-08-10
EPTCS 31, 2010, pp. 120-129
Computer Science
Formal Languages and Automata Theory
In Proceedings DCFS 2010, arXiv:1008.1270
Scientific paper
10.4204/EPTCS.31.14
One of the theoretical models proposed for the mechanism of gene unscrambling in some species of ciliates is the template-guided recombination (TGR) system by Prescott, Ehrenfeucht and Rozenberg which has been generalized by Daley and McQuillan from a formal language theory perspective. In this paper, we propose a refinement of this model that generates regular languages using the iterated TGR system with a finite initial language and a finite set of templates, using fewer templates and a smaller alphabet compared to that of the Daley-McQuillan model. To achieve Turing completeness using only finite components, i.e., a finite initial language and a finite set of templates, we also propose an extension of the contextual template-guided recombination system (CTGR system) by Daley and McQuillan, by adding an extra control called permitting contexts on the usage of templates.
Kari Lila
Rahman Afroza
No associations
LandOfFree
Ciliate Gene Unscrambling with Fewer Templates does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Ciliate Gene Unscrambling with Fewer Templates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ciliate Gene Unscrambling with Fewer Templates will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-583271