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

 

 

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

Views: 2700

Attachments:

Replies to This Discussion

Plz solution upload kr den
Upload karlay kio

Plzzzzz upload solution...

yup tomorrow last day 

Waiting for Solution.....here you go...Enjoy

https://www.youtube.com/watch?v=FW9SocNxb8Y

is m asimnt 2 ka complete solution h...???

thanks yr

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

Answer:

Old  States

New States after reading

x

y

S1- = Z1

S1,S2 = Z2

S1 = Z1

S1,S2 = Z2

S1,S2 = Z2

S1,S3 = Z3

S1,S3 = Z3+

S1,S2,S3 = Z4

S1,S3 = Z3

S1,S2,S3 = Z4+

S1,S2,S3 = Z4

S1,S3 = Z3

aoa....assig no 2 701 1st question ka solution h to kindly upload kr dain.

RSS

SPONSORED LINKS

SPONSORED LINKS

© 2019   Created by Irfan Khan MSCS.   Powered by

Badges  |  Report an Issue  |  Terms of Service