728 views

1 Answer

Best answer
2 votes
2 votes

let the symbols be a,b for the language... and L non empty(given)

1)TRUE:

 ∑ * = (a+b) * = { ε , a ,b, ab, ba , aa, ...............................}

let L = { a}  ( to make it more easy)

so ,  ∑ * / L = { ε/a , a/a , b/a , aa/a, ab/a , ba/a,aaa/a ,aba/a..............  }

                 = { ϕ ,ε, ϕ , a, ϕ , b, aa ,ab ...................................}

                 = { ε , a ,b, ab, ba , aa, ...............................} = (a+b)* ∑ *

2) FALSE:

L /  ∑ * = { a/ε , a/a ,a/b , a/aa...................................}

           = { a , ε, ϕ , ϕ   ................................} ={ε ,a}

            ≠ ϕ 

3)FALSE :

a*ba*/a* = { a*ba* /ε ,  a*ba*/a ,   ................., a*ba*/a* }

             = { a*ba* ,  a*ba+ , a*b }

             = { a*ba*}  ≠ {a*b)

Therefore , only I is true. option c

 

 

edited by

Related questions

0 votes
0 votes
1 answer
2
M_Umair_Khan42900 asked Dec 29, 2022
787 views
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b].s(a) p(pp)*( A + p)q + q and p*q(b) A +0(0+1)* + (0+1)* 00(0+1)...
0 votes
0 votes
1 answer
3
Abhipsa asked Jan 21, 2019
885 views
Why this is not equal?(r+s)*=r*+s*