A string x is said to be a substring of y if and only if there exists strings u$,$ v such that y $=$ u$$x$$v$.$

Given a language L$,$ sub$($L$)=\{$ x $|$y in L$,$ x is a substring of y$\}.$