One of the first theoretical models for DNA computing is known as splicing system. In a splicing system, two strings of DNA molecules are cut at certain recognition sites, and the prefix of the first string is connected to the suffix of the second, resulting in new strings. For a specific form of splicing system, namely semi-simple splicing systems, the recognition sites for both strings of DNA molecules are the same. Only regular languages are known to be produced by splicing systems with finite sets of axioms and splicing rules. As a result, a variety of splicing system restrictions have been considered in order to increase their generating power. Fuzzy splicing systems have been introduced, in which truth values (i.e., fuzzy membership values) from the closed interval [0, 1] are assigned to splicing system axioms. The truth values of each generated string z from strings x and y are obtained by applying a fuzzy bounded-addition operation to their truth values. This study focuses on the characteristics of bounded-addition fuzzy semi-simple splicing systems. It has been demonstrated that fuzzy semisimple splicing systems with bounded-addition operation increases the generative power of the splicing languages generated.