Skip to main content
SpringerLink
Log in
Book cover

International Conference on Developments in Language Theory

DLT 2003: Developments in Language Theory pp 134–145Cite as

Regular Languages Generated by Reflexive Finite Splicing Systems

  • Conference paper
  • First Online:

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

Abstract

Splicing systems are a generative device inspired by a cut and paste phenomenon on DNA molecules, introduced by Head in 1987 and subsequently defined with slight variations also by Paun and Pixton respectively [8, 13, 17]. We will face the problem of characterizing the class of regular languages generated by finite splicing systems. We will solve this problem for the special class of the reflexive finite splicing systems introduced in [9, 10]. As a byproduct, we give a characterization of the regular languages generated by finite Head splicing systems. As in already known results, the notion of constant, given by Schützenberger in [19], intervenes.

Partially supported by MIUR Project“Linguaggi Formali e Automi: teoria ed applicazioni”, by the contribution of EU Commission under The Fifth Framework Programme (project MolCoNet IST-2001-32008) and by 60% Project “Linguaggi Formali e Modelli di Calcolo” (University of Salerno).

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berstel, J., Perrin, D.: Theory of codes. Academic Press, New York (1985)

    MATH  Google Scholar 

  2. Bonizzoni, P., De Felice, C., Mauri, G., Zizza, R.: The structure of reflexive regular splicing languages via Schützenberger constants. manuscript (2003)

    Google Scholar 

  3. Bonizzoni, P., De Felice, C., Mauri, G., Zizza, R.: Decision Problems on Linear and Circular Splicing. In: Ito, M., Toyama, M. (eds.): DLT 2002. Lecture Notes in Computer Science, Springer-Verlag, New York (2003)

    Google Scholar 

  4. Bonizzoni, P., De Felice, C., Mauri, G., Zizza, R.: On the power of linear and circular splicing. submitted (2002)

    Google Scholar 

  5. Bonizzoni, P., Ferretti, C., Mauri, G., Zizza, R.: Separating some splicing models. Information Processing Letters 79:6 (2001) 255–259

    Article  MATH  MathSciNet  Google Scholar 

  6. Gatterdam, R.W.: Algorithms for splicing systems. SIAM Journal of Computing 21:3 (1992) 507–520

    Article  MATH  MathSciNet  Google Scholar 

  7. Goode, E., Head, T., Pixton, D. private communication (2002)

    Google Scholar 

  8. Head, T.: Formal Language Theory and DNA. An analysis of the generative capacity of specific recombinant behaviours. Bull. Math. Biol. 49 (1987) 737–759

    MATH  MathSciNet  Google Scholar 

  9. Head, T.: Splicing languages generated with one sided context. In: Paun, Gh. (ed.): Computing with Bio-molecules. Theory and Experiments, Springer-Verlag Singapore (1998)

    Google Scholar 

  10. Head, T., Paun, Gh., Pixton, D.: Language theory and molecular genetics. Generative mechanisms suggested by DNA recombination. In: Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, Vol. 2. Springer-Verlag (1996) 295–360

    Google Scholar 

  11. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. 2nd edn. Addison-Wesley, Reading, Mass. (2001)

    MATH  Google Scholar 

  12. McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press, Cambridge, Mass. (1971)

    MATH  Google Scholar 

  13. Paun, Gh.: On the splicing operation. Discrete Applied Mathematics 70 (1996) 57–79

    Article  MATH  MathSciNet  Google Scholar 

  14. Paun, Gh., Rozenberg, G., Salomaa, A.: Computing by splicing. Theoretical Computer Science 168:2 (1996) 321–336

    Article  MATH  MathSciNet  Google Scholar 

  15. Paun, Gh., Rozenberg, G., Salomaa, A.: DNA computing, New Computing Paradigms. Springer-Verlag (1998)

    Google Scholar 

  16. Perrin, D.: Finite Automata. In: van Leeuwen, J. (ed.): Handbook of Theoretical Computer Science, Vol. B. Elsevier (1990) 1–57

    Google Scholar 

  17. Pixton, D.: Linear and Circular Splicing Systems. In: Proc. of 1st Int. Symp. on Int. in Neural and Biological Systems (1996) 181–188

    Google Scholar 

  18. Pixton, D.: Regularity of splicing languages. Discrete Applied Mathematics 69 (1996) 101–124

    Article  MATH  MathSciNet  Google Scholar 

  19. Schützenberger, M.-P.: Sur certaines opérations de fermeture dans le langages rationnels. Symposia Mathematica 15 (1975) 245–253

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica Sistemistica e Comunicazione, Università degli Studi di Milano - Bicocca, Via Bicocca degli Arcimboldi 8, 20126, Milano, Italy

    Paola Bonizzoni & Giancarlo Mauri

  2. Dipartimento di Informatica ed Applicazioni, Università di Salerno, 84081, Baronissi (SA), Italy

    Clelia De Felice & Rosalba Zizza

Authors
  1. Paola Bonizzoni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Clelia De Felice
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Giancarlo Mauri
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Rosalba Zizza
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Szeged, Árpád tér 2, 6720, Szeged, Hungary

    Zoltán Ésik  & Zoltán Fülöp  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonizzoni, P., De Felice, C., Mauri, G., Zizza, R. (2003). Regular Languages Generated by Reflexive Finite Splicing Systems. In: Ésik, Z., Fülöp, Z. (eds) Developments in Language Theory. DLT 2003. Lecture Notes in Computer Science, vol 2710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45007-6_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-45007-6_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40434-7

  • Online ISBN: 978-3-540-45007-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation