Circular splicing and regularity
Paola Bonizzoni; Clelia De Felice; Giancarlo Mauri; Rosalba Zizza
RAIRO - Theoretical Informatics and Applications (2010)
- Volume: 38, Issue: 3, page 189-228
- ISSN: 0988-3754
Access Full Article
top
Abstract
topHow to cite
topBonizzoni, Paola, et al. " Circular splicing and regularity." RAIRO - Theoretical Informatics and Applications 38.3 (2010): 189-228. <http://eudml.org/doc/92739>.
@article{Bonizzoni2010,
abstract = {Circular splicing has been very recently introduced
to model a specific recombinant behaviour
of circular DNA, continuing the investigation initiated
with linear splicing. In this paper we restrict our
study to the
relationship between regular circular languages
and languages generated by finite circular splicing systems
and provide some results towards a characterization
of the intersection between these two classes.
We consider the class of languages X*, called
here star languages, which are closed under conjugacy
relation and with X being a regular language.
Using
automata theory and combinatorial techniques on words, we
show that for a subclass of star languages
the corresponding circular languages
are (Paun) circular splicing languages.
For example, star languages belong
to this subclass when X* is a free monoid
or X is a finite set.
We also prove that
each (Paun) circular splicing language L
over a one-letter alphabet has the form
L = X+ ∪ Y, with X,Y finite sets satisfying
particular hypotheses.
Cyclic and weak cyclic languages,
which will be introduced in this paper, show that this
result does not hold when we increase the size of
alphabets, even if we restrict ourselves to
regular languages.
},
author = {Bonizzoni, Paola, De Felice, Clelia, Mauri, Giancarlo, Zizza, Rosalba},
journal = {RAIRO - Theoretical Informatics and Applications},
keywords = {Molecular computing; splicing systems; formal languages; automata theory;
variable-length codes.; weak cyclic languages},
language = {eng},
month = {3},
number = {3},
pages = {189-228},
publisher = {EDP Sciences},
title = { Circular splicing and regularity},
url = {http://eudml.org/doc/92739},
volume = {38},
year = {2010},
}
TY - JOUR
AU - Bonizzoni, Paola
AU - De Felice, Clelia
AU - Mauri, Giancarlo
AU - Zizza, Rosalba
TI - Circular splicing and regularity
JO - RAIRO - Theoretical Informatics and Applications
DA - 2010/3//
PB - EDP Sciences
VL - 38
IS - 3
SP - 189
EP - 228
AB - Circular splicing has been very recently introduced
to model a specific recombinant behaviour
of circular DNA, continuing the investigation initiated
with linear splicing. In this paper we restrict our
study to the
relationship between regular circular languages
and languages generated by finite circular splicing systems
and provide some results towards a characterization
of the intersection between these two classes.
We consider the class of languages X*, called
here star languages, which are closed under conjugacy
relation and with X being a regular language.
Using
automata theory and combinatorial techniques on words, we
show that for a subclass of star languages
the corresponding circular languages
are (Paun) circular splicing languages.
For example, star languages belong
to this subclass when X* is a free monoid
or X is a finite set.
We also prove that
each (Paun) circular splicing language L
over a one-letter alphabet has the form
L = X+ ∪ Y, with X,Y finite sets satisfying
particular hypotheses.
Cyclic and weak cyclic languages,
which will be introduced in this paper, show that this
result does not hold when we increase the size of
alphabets, even if we restrict ourselves to
regular languages.
LA - eng
KW - Molecular computing; splicing systems; formal languages; automata theory;
variable-length codes.; weak cyclic languages
UR - http://eudml.org/doc/92739
ER -
References
top- L.M. Adleman, Molecular computation of solutions to combinatorial problems. Science226 (1994) 1021–1024.
- J. Berstel and D. Perrin, Theory of codes. Academic Press, New York (1995).
- J. Berstel and A. Restivo, Codes et sousmonoides fermes par conjugaison. Sem. LITP81-45 (1981) 10.
- P. Bonizzoni, C. De Felice and R. Zizza, The structure of reflexive regular splicing languages via Schützenberger constants (submitted).
- P. Bonizzoni, C. De Felice, G. Mauri and R. Zizza, DNA and circular splicing, in Proc. of DNA 2000, edited by A. Condon and G. Rozenberg. Springer, Lect. Notes Comput. Sci.2054 (2001) 117–129.
- P. Bonizzoni, C. De Felice, G. Mauri and R. Zizza, Linear and circular splicing, in WORDS99 (1999).
- P. Bonizzoni, C. De Felice, G. Mauri and R. Zizza, Decision Problems on Linear and Circular Splicing, in Proc. of DLT 2002, edited by M. Ito and M. Toyama. Springer, Lect. Notes Comput. Sci.2450 (2003) 78–92.
- P. Bonizzoni, C. De Felice, G. Mauri and R. Zizza, Regular Languages Generated by Reflexive Finite Linear Splicing Systems, in Proc. of DLT 2003, edited by Z. Esik and Z. Fulop. Springer, Lect. Notes Comput. Sci.2710 (2003) 134–145.
- P. Bonizzoni, C. De Felice, G. Mauri and R. Zizza, Linear splicing and syntactic monoid (submitted).
- P. Bonizzoni, C. De Felice, G. Mauri and R. Zizza, On the power of circular splicing (submitted).
- P. Bonizzoni, C. Ferretti, G. Mauri and R. Zizza, Separating some splicing models. Inform. Process. Lett.79 (2001) 255–259.
- C. Choffrut and J. Karhumaki, Combinatorics on Words, in Handbook of Formal Languages, edited by G. Rozenberg and A. Salomaa. Springer, Vol. 1 (1996) 329–438.
- K. Culik and T. Harju, Splicing semigroups of dominoes and DNA. Discrete Appl. Math.31 (1991) 261–277.
- L. Fuchs, Abelian groups. Pergamon Press, Oxford, London, New York and Paris (1960).
- R.W. Gatterdam, Splicing systems and regularity. Intern. J. Comput. Math.31 (1989) 63–67.
- R.W. Gatterdam, Algorithms for splicing systems. SIAM J. Comput.21 (1992) 507–520.
- T. Head, Formal Language Theory and DNA: an analysis of the generative capacity of specific recombinant behaviours. Bull. Math. Biol.49 (1987) 737–759.
- T. Head, Circular suggestions for DNA Computing, in Pattern Formation in Biology, Vision and Dynamics, edited by A. Carbone, M. Gromov and P. Pruzinkiewicz. World Scientific, Singapore and London (2000) 325–335.
- T. Head, Gh. Paun and D. Pixton, Language theory and molecular genetics: generative mechanisms suggested by DNA recombination, in Handbook of Formal Languages, edited by G. Rozenberg and A. Salomaa. Springer, Vol. 2 (1996) 295–360.
- T. Head, G. Rozenberg, R. Bladergroen, C. Breek, P. Lommerse and H. Spaink, Computing with DNA by operating on plasmids. BioSystems57 (2000) 87–93.
- J.E. Hopcroft, R. Motwani and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass. (2001).
- S.M. Kim, Computational modeling for genetic splicing systems. SIAM J. Comput.26 (1997) 1284–1309.
- M. Lothaire, Combinatorics on Words, Encyclopedia of Math. and its Appl. Addison Wesley Publishing Company (1983).
- G. Paun, On the splicing operation. Discrete Appl. Math.70 (1996) 57–79.
- G. Paun, G. Rozenberg and A. Salomaa, DNA computing, New Computing Paradigms. Springer-Verlag (1998).
- D. Pixton, Regularity of splicing languages. Discrete Appl. Math.69 (1996) 101–124.
- C. Reis and G. Thierren, Reflective star languages and codes. Inform. Control42 (1979) 1–9.
- R. Siromoney, K.G. Subramanian and A. Dare, Circular DNA and Splicing Systems, in Proc. of ICPIA. Springer, Lect. Notes Comput. Sci.654 (1992) 260–273.
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.