The splicing operation was introduced in 1987 by Head as a mathematical model of the recombination of DNA molecules under the influence of restriction and ligases enzymes. This operation allows us to define a computing (language generating) device, called a splicing system. Other variants of this original definition were also proposed by Paun and Pixton respectively. The computational power of splicing systems has been thoroughly investigated. Nevertheless, an interesting problem is still open, namely the characterization of the class of regular languages generated by finite splicing systems. In this paper, we will solve the problem for a special class of finite splicing systems, termed reflexive splicing systems, according to each of the definitions of splicing given by Paun and Pixton. This special class of systems contains, in perticular, finite Head splicing systems. The notion of a constant, given by Schutzenberger, once again intervenes. © 2005 Elsevier B.V. All rights reserved.
Bonizzoni, P., De Felice, C., & Zizza, R. (2005). The structure of reflexive regular splicing languages via Schuetzenberger constants. THEORETICAL COMPUTER SCIENCE, 334(1), 71-98.
|Citazione:||Bonizzoni, P., De Felice, C., & Zizza, R. (2005). The structure of reflexive regular splicing languages via Schuetzenberger constants. THEORETICAL COMPUTER SCIENCE, 334(1), 71-98.|
|Tipo:||Articolo in rivista - Articolo scientifico|
|Carattere della pubblicazione:||Scientifica|
|Titolo:||The structure of reflexive regular splicing languages via Schuetzenberger constants|
|Autori:||Bonizzoni, P; De Felice, C; Zizza, R|
|Data di pubblicazione:||11-apr-2005|
|Rivista:||THEORETICAL COMPUTER SCIENCE|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1016/j.tcs.2004.12.033|
|Appare nelle tipologie:||01 - Articolo su rivista|