Descriptional Complexity of Semi-Simple Splicing Systems

Abstract

Splicing systems are generative mechanisms introduced by Tom Head in 1987 to model the biological process of DNA recombination. The computational engine of a splicing system is the "splicing operation", a cut-and-paste binary string operation defined by a set of "splicing rules" r = (α1, α2; α3, α4) where α1, α2, α3, α4 are words over an alphabet Σ. For two strings x = x1α1α2x2 and y = y1α3α4y2, applying the splicing rule r produces the string z = x1α1α4y2. In this paper we focus on a particular type of splicing systems, called (i, j) semi-simple splicing systems, i = 1, 2 and j = 3, 4, wherein all splicing rules have the property that the two strings in positions i and j are singleton letters, while the other two strings are empty. The language generated by such a system consists of the set of words that are obtained starting from an initial set called "axiom set", by iteratively applying the splicing rules to strings in the axiom set as well as to intermediately produced strings. We consider semi-simple splicing systems where the axiom set is a regular language, and investigate the descriptional complexity of such systems in terms of the size of the minimal deterministic finite automata that recognize the languages they generate.1 Simple splicing language classes are pairwise incomparable except for the pair (1,3) and (2,4), which are equivalent [11]