Linear splicing and syntactic monoid ?
Splicing systems were introduced by Head in 1987 as a formal counterpart of a biological mechanism of DNA recombination under the action of restriction and ligase enzymes. Despite the intensive studies on linear splicing systems, some elementary questions about their computational power are still open. In particular, in this paper we face the problem of characterizing the proper subclass of regular languages which are generated by finite (Paun) linear splicing systems. We introduce here the class of marker languages L , i.e., regular languages with the form L=L1[x]1L2 L = L 1 [ x ] 1 L 2 , where L1,L2 L 1 , L 2 are regular languages, [x] [ x ] is a syntactic congruence class satisfying special conditions and [x]1 [ x ] 1 is either equal to [x] [ x ] or equal to [x]?{1} [ x ] ? { 1 } , 1 being the empty word. Using classical properties of formal language theory, we give an algorithm which allows us to decide whether a regular language is a marker language. Furthermore, for each marker language L we exhibit a finite Paun linear splicing system and we prove that this system generates L.
regular languages automata molecular computing