In this paper, we associate the idea of derivation languages with a restricted variant of flat splicing systems where at each step splicing is done with an element from the initial set of words present in the system. We call these flat splicing systems as restricted flat splicing systems. We show that the families of Szilard languages of labeled restricted flat finite splicing systems of type $(m,n)$ and REG, CF and CS are incomparable. Also, any non-empty regular, non-empty context-free and recursively enumerable language can be obtained as homomorphic image of the Szilard language of the labeled restricted flat finite splicing systems of type $(1,2),(2,2)$ and $(5,2)$ respectively. We also introduce the idea of control languages for restricted labeled flat finite splicing systems and show that any non-empty regular and context-free language can be obtained as a control language of labeled restricted flat finite splicing systems of type $(1,2)$ and $(2,2)$ respectively. At the end, we show that any recursively enumerable language can be obtained as a control language of labeled restricted flat finite splicing systems of type $(5,2)$ when λ-labeled rules are allowed.

在本文中，我们将派生语言的思想与平面拼接系统的一个受限制的变体相关联，在平面拼接系统的每一步中，拼接都是使用系统中存在的初始单词集中的元素进行的。我们将这些平面拼接系统称为受限平面拼接系统。我们显示标记类型的有限平面有限拼接系统的Szilard语言族$（米，ñ）$和REG，CF和CS是无法比拟的。同样，任何非空的常规，非空的上下文无关且可递归枚举的语言都可以作为带标记的受限平面有限拼接系统的Szilard语言的同态图像获得。$（\mathrm{1个}，2），（2，2）$ 和 $（5，2）$分别。我们还介绍了受限制的带标签的平面有限拼接系统的控制语言的概念，并表明可以将任何非空的常规和上下文无关的语言作为具有类型的带标签的带限制的平面有限拼接系统的控制语言来获得。$（\mathrm{1个}，2）$ 和 $（2，2）$分别。最后，我们表明，可以将任何递归枚举语言作为带标记的受限平面有限拼接系统类型的控制语言来获得。$（5，2）$当允许使用λ标记的规则时。