Difference between revisions of "Identify the class of the language"

Revision as of 15:32, 8 February 2014

1. $L = \{wxw | w,x ∈ \{{a,b}\}^*\} $

Here, <math>L</math> can generate all strings in <math>\Sigma^*</math>, by making <math>x = (a+b)^*</math> and <math>w = \epsilon</math>. Hence, <math>L</math> is regular.

2. $L = \{wxw| w,x ∈ \{{a,b}\}^+\}$

Here, L is not generating all strings in <math>\Sigma^*</math> as the strings like abab are not generated by L. L is actually generating all strings except those of the form <math>ww, w \in (a+b)^*</math>. To do this is not we need at least an <math>LBA</math>, making <math>L</math>, a <math>CSL</math>.

1.WW | such that W=(a+b)*

2.WW | such that W=(a+b)+

6.WWr | such that W=(a+b)*

7.WWr| such that W=(a+b)+

8.1.WXWr | such that W,X=(a+b)*

9.WXWr | such that W,X=(a+b)+