Skip to main content
SpringerLink
Log in

On Decidability and Closure Properties of Language Classes with Respect to Bio-operations

  • Conference paper
DNA Computing and Molecular Programming (DNA 2014)

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

Included in the following conference series:

Abstract

We present general results that are useful in showing closure and decidable properties of large classes of languages with respect to biologically-inspired operations. We use these results to prove new decidability results and closure properties of some classes of languages under hairpin-inversion, pseudo-inversion, and other bio-operations. We also provide a new approach for proving the undecidability of problems involving bio-operations for which the usual method of reduction to the undecidability of the Post Correspondence Problem (PCP) may not be easy to apply. Our closure and decidability results strengthen or generalize previous results.

Supported in part by NSF Grants CCF-1143892 and CCF-1117708.

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 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.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. Cho, D.-J., Han, Y.-S., Kang, S.-D., Kim, H., Ko, S.-K., Salomaa, K.: Pseudo-inversion on formal languages. In: Ibarra, O.H., Kari, L., Kopecki, S. (eds.) UCNC 2014. LNCS, vol. 8553, pp. 93–104. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  2. Daley, M., Ibarra, O.H., Kari, L.: Closure and decidability properties of some languages classes with respect to ciliate bio-operations. Theoret. Comput. Sci. 306(1-3), 19–38 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  3. Daley, M., Kari, L., McQuillan, I.: Families of languages defined by ciliate bio-operations. Theoret. Comput. Sci. 320(1), 51–69 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  4. Deaton, R., Garzon, M., Murphy, R.C., Rose, J.A., Franceschetti, D.R., Stevens Jr., S.E.: Genetic search of reliable encodings for DNA-based computation. In: Proc. of 1st Conf. on Genetic Programming, pp. 9–15 (1996)

    Google Scholar 

  5. Garzon, M., Deaton, R., Nino, L.F., Stevens, E., Wittner, M.: Encoding genomes for DNA computing. In: Genetic Programming 1998: Proc. of 3rd Annual Conf., pp. 684–690 (1998)

    Google Scholar 

  6. Gurari, E., Ibarra, O.H.: The complexity of decision problems for finite-turn multicounter machines. J. Comput. Syst. Sci. 22, 220–229 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  7. Hague, M., Lin, A.W.: Model checking recursive programs with numeric data types. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 743–759. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  8. Hussini, S., Kari, L., Konstantinidis, S.: Coding properties of DNA languages

    Google Scholar 

  9. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata, Languages and Computation. Addison-Wesley (1978)

    Google Scholar 

  10. Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. J. of the ACM 25(1), 116–133 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  11. Ibarra, O.H., Jiang, T., Tran, N.Q., Wang, H.: New decidability results concerning two-way counter machines. SIAM J. Comput. 24(1), 123–137 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  12. Jonoska, N., Kari, L., Mahalingam, K.: Involution solid and join codes. Fundamenta Informaticae 86(1,2), 127–142 (2008)

    MATH  MathSciNet  Google Scholar 

  13. Jonoska, N., Mahalingam, K., Chen, J.: Involution codes: with application to DNA coded languages. Natural Computing 4(2), 141–162 (2005)

    Article  MathSciNet  Google Scholar 

  14. Kari, L., Lossevsa, E., Konstantinidis, S., Sosik, P., Thierrin, G.: A formal language analysis of DNA hairpin structures. Fundamenta Informaticae 71(4), 453–475 (2006)

    MATH  MathSciNet  Google Scholar 

  15. Kari, L., Mahalingam, K.: DNA codes and their properties. In: Mao, C., Yokomori, T. (eds.) DNA12. LNCS, vol. 4287, pp. 127–142. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Minsky, M.: Recursive unsolvability of Post’s problem of Tag and other topics in the theory of Turing machines. Ann. of Math. (74), 437–455 (1961)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA

    Oscar H. Ibarra

Authors
  1. Oscar H. Ibarra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Graduate School of Engineering, Department of Bioengineering and Robotics, Tohoku University, 6-6-01 Aoba-yama, 980-8579, Sendai, Japan

    Satoshi Murata

  2. Graduate School of Informatics and Engineering, Department of Communication Engineering and Informatics, University of Electro-Communications, 1-5-1 Chofugaoka, 182-8585, Chofu, Tokyo, Japan

    Satoshi Kobayashi

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Ibarra, O.H. (2014). On Decidability and Closure Properties of Language Classes with Respect to Bio-operations. In: Murata, S., Kobayashi, S. (eds) DNA Computing and Molecular Programming. DNA 2014. Lecture Notes in Computer Science, vol 8727. Springer, Cham. https://doi.org/10.1007/978-3-319-11295-4_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11295-4_10

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11294-7

  • Online ISBN: 978-3-319-11295-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation