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 , called here star languages, which are closed...
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
and languages generated by
and provide some results towards a characterization
of the intersection between these two classes.
We consider the class of languages , called
here , which are closed under conjugacy
relation and with being a regular language.
Using
automata...
We compare various computational complexity classes defined within the framework of membrane systems, a distributed parallel computing device which is inspired from the functioning of the cell,
with usual computational complexity classes for Turing machines. In particular, we focus our attention on the comparison among complexity classes for membrane systems with active membranes (where new membranes can be created by division of existing membranes) and the classes , , and .
Download Results (CSV)