Regular languages generated by reflexive finite splicing systems

  • Authors:

  • Paola Bonizzoni;Clelia De Felice;Giancarlo Mauri;Rosalba Zizza

  • Affiliations:

  • Dipartimento di Informatica Sistemistica e Comunicazione, Università degli Studi di Milano, Bicocca, Milano, Italy;Dipartimento di Informatica ed Applicazioni, Università di Salerno, Baronissi, SA, Italy;Dipartimento di Informatica Sistemistica e Comunicazione, Università degli Studi di Milano, Bicocca, Milano, Italy;Dipartimento di Informatica ed Applicazioni, Università di Salerno, Baronissi, SA, Italy

  • Venue:
  • DLT'03 Proceedings of the 7th international conference on Developments in language theory
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

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.