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.

Theory of Automata (CS402)
Assignment # 2(Graded)
Total marks = 20
Deadline Date = Jun 04, 2015

Please carefully read the following instructions before attempting assignment.
Rules for Marking
It should be clear that your assignment would not get any credit if:

 The assignment is submitted after the due date.
 The submitted assignment does not open or file is corrupt.
 Strict action will be taken if submitted solution is copied from any other student or from the internet.

1) You should concern the recommended books to clarify your concepts as handouts are not sufficient.
2) You are supposed to submit your assignment in ppt or pptx format. Any other formats like scan images, PDF, zip, rar, doc and bmp etc will not be accepted.

Note:
No assignment will be accepted after the due date via email in any case (whether it is the case of load shedding or internet malfunctioning etc.). Hence refrain from uploading assignment in the last hour of deadline. It is recommended to upload solution file at least two days before its closing date.

For any query, feel free to email at:
cs402@vu.edu.pk
Q.1. Derive Regular Expressions (RE) for the following Transition Graph:



Guidelines for Recording Audio Narration:

• You are required to submit your solution as power point presentation (ppt or pptx).
• Use the template for solution that is attached with assignment file.
• The total time for audio recording should not exceed 4 minutes.
• Make sure that your recorded voice is clear before submission on LMS.
• If audio is not clear or corrupt, then zero marks will be awarded.
• Record your presentation as given in demo video attached with assignment. For MS-Office 2003, watch “Audio Narration Recording Office 2003” while in case of Office 2007 follow “Audio Narration Recording Office 2007”.
• If you are using Office 2013, then save your solution file with “Save as type”= “PowerPoint 97-2003 Presentation”.
• On first slide write your name, VU-ID and version of MS-Office you are going to use.
• In rest of the slides, show your solution with audio explanation in a step by step fashion.
• Moreover, don’t forget to record your name and VU-ID on the very first slide.


Best of luck!

+ 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: 13516

.

+ 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

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.

aoa kia kisi ak TG k ak sy zayada RE ho skty hany can anyone tell me.

yes TG k ak sy zayada RE ho skty han

cs402..ki assignment send kary..due date..3dec..2015..

Q.1. Derive Regular Expressions (RE) for the following Transition Graph:

RE=a* (b+f) c* (d+g) e*

m still not getting it... can u elaborate plz how did u write this RE?

from diagram add b and f then add d and g in first step .

         

 

                                   

                                                                                      

                                                        

                                                                                                        

 

                                                                            

                                                                             

 

                                                 

is this corret ans

you can not eliminate a loop between two states like this you (b+f)....

this method can only be applied  in case when we have transitions going to only one direction.....

aoa

bro do you have solution of this assignment

I think the RE for the given TG is 
aa(b+f)CC*(d+g)EE*

as there are loops in A , B and C

RSS

Today Top Members 

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

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

.