Latest Activity In Study Groups

Join Your Study Groups

VU Past Papers, MCQs and More

We non-commercial site working hard since 2009 to facilitate learning Read More. We can't keep up without your support. Donate.

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

Views: 2608

Replies to This Discussion

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. 

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

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

Please check RE of L1 and L2 is correct.

Where is GTG and its RE?

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.

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

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

Please upload solution file thanks.

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

file plz 

CS402 Assignment No 03 Solution Spring 2019

CS402 Assignment No 03 Solution Spring 2019

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

RSS

Looking For Something? Search Below

Latest Activity

waseem akram left a comment for Huma Ahmad
5 hours ago
waseem akram left a comment for Huma Ahmad
5 hours ago
Hania Khalid Shariff is now friends with Mr Siren Head and Huma Ahmad
7 hours ago
saba zulfqar posted blog posts
10 hours ago
+ ¢αяєℓєѕѕ gιяℓ updated their profile
11 hours ago
saba zulfqar and Hania Khalid Shariff are now friends
13 hours ago
Mr Siren Head replied to Hania Khalid Shariff's discussion zero semester
19 hours ago
Profile Iconshahzad Hussain and Umar Farooq joined Virtual University of Pakistan
19 hours ago

VIP Member Badge & Others

How to Get This Badge at Your Profile DP

------------------------------------

Management: Admins ::: Moderators

Other Awards Badges List Moderators Group

© 2021   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service