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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Aho, A.V.: Indexed grammars – an extenion of context-free grammars. Journal of the ACM 15, 647–671 (1968)
Daley, M., Ibarra, O., Kari, L., McQuillan, I., Nakano, K.: Closure and decision properties of some language classes under ld and dlad bio-operations. J. Automata, Languages and Combinatorics 8, 477–498 (2003)
Daley, M., McQuillan, I.: Template-guided DNA recombination. Theoret. Comput. Sci. 330, 237–250 (2005)
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-6
Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press Inc., New York (1974)
Engelfriet, J.: Iterated stack automata and complexity classes. Information and Computation 95, 21–75 (1991)
Ginsburg, S.: Algebraic and Automata-Theoretic Properties of Formal Languages. North-Holland, Amsterdam (1975)
Head, T., Pixton, D.: Splicing and regularity (to appear), available at: http://www.math.binghamton.edu/dennis/Papers
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
Prescott, D.M.: Genome Gymnastics: Unique modes of DNA evolution and processing in ciliates. Nature Reviews Genetics 1, 191–198 (2000)
Prescott, D.M., Ehrenfeucht, A., Rozenberg, G.: Template guided recombination for IES elimination and unscrambling of genes in stichotrichous ciliates. J. Theoretical Biology 222, 323–330 (2003)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 1–3. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
McQuillan, I., Salomaa, K., Daley, M. (2006). Iterated TGR Languages: Membership Problem and Effective Closure Properties. In: Chen, D.Z., Lee, D.T. (eds) Computing and Combinatorics. COCOON 2006. Lecture Notes in Computer Science, vol 4112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11809678_12
Download citation
DOI: https://doi.org/10.1007/11809678_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36925-7
Online ISBN: 978-3-540-36926-4
eBook Packages: Computer ScienceComputer Science (R0)