Iterated TGR Languages: Membership Problem and Effective Closure Properties
We show that membership is decidable for languages defined by iterated template-guided recombination systems when the set of templates is regular and the initial language is context-free. Using this result we show that when the set of templates is regular and the initial language is context-free (respectively, regular) we can effectively construct a pushdown automaton (respectively, finite automaton) for the corresponding iterated template-guided recombination language.
KeywordsTuring Machine Regular Language Closure Property Membership Problem Pushdown Automaton
Unable to display preview. Download preview PDF.
- 4.Daley, M., McQuillan, I.: Useful templates and iterated template-guided DNA recombination in ciliates. Theory of Computing Systems (in press). E-print available doi: 10.1007/s00224-005-1206-6Google Scholar
- 8.Head, T., Pixton, D.: Splicing and regularity (to appear), available at: http://www.math.binghamton.edu/dennis/Papers
- 9.McQuillan, I., Salomaa, K., Daley, M.: Iterated TGR languages: Membership problem and effective closure properties. Queen’s School of Computing Technical Report No. 2006-513, available at: http://www.cs.queensu.ca/TechReports