I, a language L is a set of strings, that is a subset of the
universal language I*.
On languages we can define the usual set operations that is union, intersection and complement of languages.L1 and L2 are two languages, we define:
L1 and L2, denoted by L1L2, as the set of all words given by the concatenation of any word in L1 with any word in L2.
L={x|x=uv and u belongs to L1 and v belongs to L2}
L, denoted by L*, as the language:
L*=L0 U L1 U L2 U ...where
L0 is the empty string and Ln=Ln-1L
is the language consisting of the words of length n for
n>0.
I, defined as the smallest class containing all the finite languages and closed with respect to union, concatenation and Kleene closure.
Back to Index