Abstract
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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
McQuillan, I., Salomaa, K., & Daley, M. (2006). Iterated TGR languages: Membership problem and effective closure properties. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4112 LNCS, pp. 94–103). Springer Verlag. https://doi.org/10.1007/11809678_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
