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.

Question No.01: Construct Nondeterministic Finite Automaton (NFA) for the following regular expression:

a) (Y + Z)Y*( YZ + ZY )
b) (Y + Z)(YZ)*(Y)

Question No.02: Convert the following NFA to an FA with the help of a transition table.

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

.

+ 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. Read More>>

 

Note:-

For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.

For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.

Or visit this link 

Click Here For Detail.

&

.•°How to Download past papers from study groups°•. 

CS402 Theory of Automata Assignment No. 2 Solution Fall 2016 Due Date: Dec 05, 2016

CS402 Theory of Automata Assignment No. 2 Solution Fall 2016 Due Date: Dec 05, 2016

Assignment No. 02

Semester Fall 2016
CS402- Theory of Automata

 

Total Marks: 20

 

Due Date: 05/12/2016

Instructions

Please read the following instructions carefully before solving & submitting assignment:

It should be clear that your assignment will not get any credit  if:

  • The assignment is submitted after due date.
  • The submitted assignment does not open or file corrupt.
  • The assignment is full or partially copied from (other student or ditto copy from handouts or internet).
  • Student ID is not mentioned in the assignment File or name of file is other than student ID.
  • The assignment is not submitted in .doc or .docx format.

Uploading instructions

Your submission must include:

 

  • Assignment should be in .doc or .docx format.
  • Save your assignment with your ID (e.g. bx020200786.doc).

Assignment submission through email is NOT acceptable

Objective

The objective of this assignment is

  • To give knowledge and understanding of Nondeterministic Finite Automat (NFA).
  • To be able to draw NFA and NFA to Finite Automata (FA).

 

Note:

Your answer must follow the below given specifications.

  •  Font style: “Times New Roman”
  •  Font color: “Black”
  •  Font size: “12”
  •  Bold for heading only.
  •  Font in Italic is not allowed at all.
  •  No formatting or bullets are allowed to use.
  • Your answer should be precise and to the point, avoid irrelevant detail.

 

Lectures Covered

 

  This assignment covers Lecture #  14 -17

 

 

 

 

 

 

 

Question No.01: Construct Nondeterministic Finite Automaton (NFA) for the following regular expression:

 

a)      (Y + Z)Y*( YZ + ZY )

b)      (Y + Z)(YZ)*(Y)

 

 

 

Question No.02: Convert the following NFA to an FA with the help of a transition table.

 

      

 

 

 

 

 

 

 

 

 

 

 

Deadline:

Your assignment must be uploaded/submitted at or before 05/12/2016.

 

 

For any query about the assignment, contact at CS402@vu.edu.pk

 

     GOOD LUCK

Dear Students Don’t wait for solution post your problems here and discuss ... after discussion a perfect solution will come in a result. So, Start it now, replies here give your comments according to your knowledge and understandings....

Question no 1 kese solve ho ga????

Q.2 ksy ho ga plz help??

solution plzzz...

solve krna b koi start kry 

Dear Students Here is complete solution of Assignment No. 2 Watch video 

 

Thanks allot for helping,

yeh sahi hai na

Attachments:

plz share the solution in doc format

Name of sotfware used for 1st Q...mean prepared nfa

RSS

Today Top Members 

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

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

.