1.Create R.E for a language allowing all possible strings over ={a, b, c} but every substring should start and end with a dissimilar letters. 2.

1.Create R.E for a language allowing all possible strings over Σ={a, b, c} but every substring should start and end with a dissimilar letters.

2. Describe what kind of strings the R.E = (a+b+c)*(aa+bb+cc) will produce.

3.  Prove Kleen’s Theory Part II.