Language study on Spliced Semigraph using Folding techniques

Abstract

In this paper, we proposed algorithm to identify cut vertices and cut edges for n-Cut Spliced Semigraph and splicing the n-Cut Spliced Semigraph using cut vertices else cut edges or combination of cut vertex and cut edge and applying sequence of folding to the spliced semigraph to obtain the semigraph quadruple η(S)=(2, 1, 1, 1). We observed that the splicing and folding using both cut vertices and cut edges is applicable only for n-Cut Spliced Semigraph where n > 2. Also, we transformed the spliced semigraph into tree structure and studied the language for the semigraph with n+2 vertices and n+1 semivertices using Depth First Edge Sequence algorithm and obtain the language structure with sequence of alphabet ‘a’ and ‘b’.