Skip to main content
SpringerLink
Log in

A Proof of Regularity for Finite Splicing

  • Chapter
Aspects of Molecular Computing

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2950))

Abstract

We present a new proof that languages generated by (non extended) H systems with finite sets of axioms and rules are regular.

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. Culik II, K., Harju, T.: The regularity of splicing systems and DNA. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol. 372, pp. 222–233. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  2. Culik II, K., Harju, T.: Splicing semigroups of dominoes and DNA. Discrete Applied Mathematics 31, 261–277 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  3. Garret, R.H., Grisham, C.M.: Biochemistry. Saunders College Publishing, Harcourt (1997)

    Google Scholar 

  4. Head, T.: Formal language theory and DNA: an analysis of the generative capacity of recombinant behaviors. Bulletin of Mathematical Biology 49, 737–759 (1987)

    MATH  MathSciNet  Google Scholar 

  5. Head, T., Păun, G., Pixton, D.: Language theory and molecular genetics. In: [11], ch. 7, pp. 295–360 (1997)

    Google Scholar 

  6. Manca, V.: Splicing normalization and regularity. In: Calude, C., Păun, G. (eds.) Finite versus Infinite. Contributions to an Eternal Dilemma. Springer, Heidelberg (2000)

    Google Scholar 

  7. Manca, V.: On some forms of splicing. In: Martin-Vide, C., Mitrana, V. (eds.) Words, Sequences, Grammars, Languages: Where Biology, Computer Science, Linguistics and Mathematics Meet. Kluwer, Dordrecht (2000)

    Google Scholar 

  8. Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing. New Computing Paradigms. Springer, Berlin (1998)

    Google Scholar 

  9. Pixton, D.: Regularity of splicing languages. Discrete Applied Mathematics 69(1-2), 101–124 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  10. Pixton, D.: Splicing in abstract families of languages. Theoretical Computer Science 234, 135–166 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  11. Rozenberg, G., Salomaa, A.: Handbook of Formal Languages, 3 vols. Springer, Heidelberg (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Verona, Ca’ Vignal 2 – Strada Le Grazie 15, 37134, Verona, Italy

    Vincenzo Manca

Authors
  1. Vincenzo Manca
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of South Florida, 4202 E. Fowler Ave, 33620, Tampa, Fl, USA

    Nataša Jonoska

  2. Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700, Bucureşti, Romania

    Gheorghe Păun

  3. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Manca, V. (2003). A Proof of Regularity for Finite Splicing. In: Jonoska, N., Păun, G., Rozenberg, G. (eds) Aspects of Molecular Computing. Lecture Notes in Computer Science, vol 2950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24635-0_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24635-0_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20781-8

  • Online ISBN: 978-3-540-24635-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation