We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

+ Link For Past Papers, Solved MCQs, Short Notes & More


Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

How to Add New Discussion in Study Group ? Step By Step Guide Click Here.

+ How to Follow the New Added Discussions at Your Mail Address?

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?


See Your Saved Posts Timeline

Views: 7667

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

+ Click Here To Join (Our facebook study Group)

Attachments:

Replies to This Discussion

im still not sure about the RE
jise doubt ho,wo bs RE ko likhy e na,baqi sb kr le

Q 2

The language of strings defines over Ʃ = {a, b}

CFG corresponding to the above FA may be

S→ aA|bS|ʌ

A→ aB|bS

B→ aC|bC|ʌ

C→ aC|bB|ʌ

The number of terminals in above CFG is equal to the number of states of corresponding FA.

SaA

aaB

aabB

aabaC

aabaʌ

So aaba language accepted by given FA.so its equalint.

100% right solution of cs402 assignment #4

Attachments:

RSS

Today Top Members 

1 Biya

Biya

2 Asad

Asad

3 Ahmad

Ahmad

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

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

.