1,398 views
0 0 votes

2 Answers

Best answer
1 1 vote

This could be solved using some basic Regular Expression Identities.

1)$\phi$*=$\varepsilon$

2)R.$\phi$=$\phi$.R=$\phi$

3)R.$\varepsilon$=$\varepsilon$.R=R

Where R is some Regular Expression.

Let's find L3'=Complement of L3=a*-L3

Since LE is defined over Alphabet With only symbol a.

L3'=a*-{a,$\varepsilon$}

L3'={$\varepsilon$,$a$,${a^2}$,$a^3$,$a^4$,.......} - {$a$,$\varepsilon$}

L3'={$a^2$,$a^3$ ,$a^4$,$a^5$,.......}

L3'={$a^n$/ $n$>=2}

Now,Solving the Expression

 L3'.L2.L1*+L1.L3'=L3'.$\varepsilon$.$\phi$*+$\phi$.L3'

                                 =L3'.$\varepsilon$.$\varepsilon$ +$\phi$(using $1$ and $2$)

                                   =L3'+$\phi$

                                    =L3'

                                    ={$ a^2$/$n$>=2}

​​​

Thus ,option D holds.

 

• selected by
0 0 votes

.

Position:
Show:

Related questions

0 0 votes
1 1 answer
810
810 views
dragonball asked Dec 20, 2017
810 views
1. Turing Decidable means Recursive language2. Turing recognizable means REL3. Decidable means Recursive4. Undecidable means REL or Turing Recognizable. Does the ...
2 2 votes
1 1 answer
1.7k
1.7k views
3 3 votes
1 1 answer
676
676 views
Kai asked Jan 31, 2017
676 views
Match the followingMatch the followingList - I( P ) Finite length C - program(Q) 108 Dimensional TM(R) 100 Head Turing Machine(S) 101 tape multiple TMList - II1. R.E. set...
1 1 vote
3 3 answers
1.2k
1.2k views
Pratik.patil asked Oct 30, 2023
1,198 views
Which of the following regular expression represent the set of all the strings not containing $100$ as a substring ?$0^*(1^*0)^*$$0^*1010^*$$0^*1^*01^*$$0^*(10+1)^*$