Skip to main content
SpringerLink
Log in

Iterated TGR Languages: Membership Problem and Effective Closure Properties

  • Conference paper
Computing and Combinatorics (COCOON 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4112))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V.: Indexed grammars – an extenion of context-free grammars. Journal of the ACM 15, 647–671 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  2. 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)

    MATH  MathSciNet  Google Scholar 

  3. Daley, M., McQuillan, I.: Template-guided DNA recombination. Theoret. Comput. Sci. 330, 237–250 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  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-6

    Google Scholar 

  5. Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press Inc., New York (1974)

    MATH  Google Scholar 

  6. Engelfriet, J.: Iterated stack automata and complexity classes. Information and Computation 95, 21–75 (1991)

    Article  MathSciNet  Google Scholar 

  7. Ginsburg, S.: Algebraic and Automata-Theoretic Properties of Formal Languages. North-Holland, Amsterdam (1975)

    MATH  Google 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

  10. Prescott, D.M.: Genome Gymnastics: Unique modes of DNA evolution and processing in ciliates. Nature Reviews Genetics 1, 191–198 (2000)

    Article  Google Scholar 

  11. 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)

    Article  MathSciNet  Google Scholar 

  12. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 1–3. Springer, Heidelberg (1997)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Saskatchewan, Saskatoon, Saskatchewan, S7N 5A9, Canada

    Ian McQuillan

  2. School of Computing, Queen’s University, Kingston, Ontario, K7L 3N6, Canada

    Kai Salomaa

  3. Department of Computer Science and Department of Biology, University of Western Ontario, London, Ontario, N6A 5B7, Canada

    Mark Daley

Authors
  1. Ian McQuillan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kai Salomaa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mark Daley
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, University of Notre Dame, IN 46556, Notre Dame, USA

    Danny Z. Chen

  2. Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan

    D. T. Lee

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation