Regular Languages Generated by Reflexive Finite Splicing Systems

  • Paola Bonizzoni
  • Clelia De Felice
  • Giancarlo Mauri
  • Rosalba Zizza
Conference paper

DOI: 10.1007/3-540-45007-6_10

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2710)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Paola Bonizzoni
    • 1
  • Clelia De Felice
    • 2
  • Giancarlo Mauri
    • 1
  • Rosalba Zizza
    • 2
  1. 1.Dipartimento di Informatica Sistemistica e ComunicazioneUniversità degli Studi di Milano - BicoccaMilanoItaly
  2. 2.Dipartimento di Informatica ed ApplicazioniUniversità di SalernoBaronissi (SA)Italy

Personalised recommendations