It is known that the class of factorizing codes, i.e., codes satisfying the factorization conjecture formulated by Schützenberger, is closed under two operations: the classical composition of codes and substitution of codes. A natural question which arises is whether a finite set of operations exists such that each factorizing code can be obtained by using the operations in and starting with prefix or suffix codes. is named here a complete set of operations (for factorizing codes). We show...
It is known that the class
of , ,
codes satisfying the
formulated by Schützenberger, is
closed under two operations:
the classical
of codes and
of codes.
A natural question which arises
is whether
a finite set
of operations
exists
such that each factorizing
code can be obtained by using
the operations in
and starting with prefix or suffix codes.
is named here
a
of operations (for factorizing codes).
We show that composition and substitution
are not enough in order to obtain
a complete
set....
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...
Download Results (CSV)