Sigma = {a,b}
Sigma^0 = Set of all strings with length 0 = Non-string = Epsilon = 2^0
Sigma^1 = Set of all strings with length 1 = {a,b}=2^1 = 2= Sigma^* = Sigma^+ + Sigma^0
Sigma^2 = Set of all strings with length 2
Sigma.Sigma = {a,b}{a,b} = {aa,ab,ba,bb} ----> Example of finite language = 2^2
Sigma^3 = Set of strings with length 3 = Sigma.Sigma.Sigma = {a,b}{a,b}{a,b} = {aaa,aab , aba,abb , baa , bab ,bba ,bbb } = 2^3
Sigma^(Kleme Closure) = (a+b)^ = Infinite Language
Sigma^+ = Positive Closure
Top comments (0)