CS402 Assignment No 03 Spring 2019 Solution & Discussion

[+M.Tariq Malik]

CS402 Assignment No 03 Spring 2019 Solution & Discussion

Please Discuss here about this assignment.Thanks

Our main purpose here discussion not just Solution

We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions. Read More>>

Discussed & be touched with this discussion. After discussion a perfect solution will come in a result at the end.

 

“How to Join Subject Study Groups & Get Helping Material”

 

P.S:    Please always try to add the discussion in proper format title like “CS101 Assignment / GDB No 01 Solution & Discussion Due Date: ___________”

 

Share below link with friends for solution & Discussion. A Single link for help in your education.

http://bit.ly/vucodes

 

Site Overview | Assignment Solutions | Past Papers |Site Features

[+M.Tariq Malik]

Question:                                                                             Marks=5+5=10Question:                                                                             Marks=5+5=10As we know that if two languages (L1 & L2) are Regular Languages then L1 ∩L2 is also regular. You have given two regular languages L1 & L2, defined over the alphabet ∑= {a,b}L1= language of words having triple a’s.L2= language of words containing ab. According to these two languages you need to provide a step by step solution for L1 ∩L2 using De-Morgan’s Law. 

[Waleed Ahmad]

Solution:

 

L1= language of words having triple a’s.

 

The regular expression L1 is as below

R.E = (a+b)^* (aaa) (a+b)^*

 

L2= language of words containing ab.

The regular expression L2 is as below

RE = (a+b)^* (ab) (a+b)^*

 

Using De-Morgan’s law for sets

(L₁^C U L₂^C)^C = (L₁^C)^C ∩ (L₂^C)^C = L₁ ∩ L₂

_{Please check RE of L1 and L2 is correct.}

[Waleed Ahmad]

Where is GTG and its RE?

[SAFA]

olution:



L1= language of words having triple a’s.



The regular expression L1 is as below

R.E = (a+b)* (aaa) (a+b)*



L2= language of words containing ab.

The regular expression L2 is as below

RE = (a+b)* (ab) (a+b)*



Using De-Morgan’s law for sets

(L1C U L2C)C = (L1C)C ∩ (L2C)C = L1 ∩ L2

Please check RE of L1 and L2 is correct.

[WAQAS AHMAD]

Plz send the complate file .........thanks

[SAFA]

***************

[Bilal javaid]

Please upload solution file thanks.

[+M.Tariq Malik]

CS402 (Theory of Automata) Assignment No. 3 Solution Spring 2019

[Zari]

file plz 

[+M.Tariq Malik]

CS402 Assignment No 03 Solution Spring 2019

CS402 Assignment No 03 Solution Spring 2019

[Amjad Shahzad]

solution ki samg nih lagy rahe .solution shae waley file upload kro