## Register Now

Lorem ipsum dolor sit amet, consectetur adipiscing elit.Morbi adipiscing gravdio, sit amet suscipit risus ultrices eu.Fusce viverra neque at purus laoreet consequa.Vivamus vulputate posuere nisl quis consequat.

## CS402- Assignment Solution

Assignment No. 01
SEMESTER Spring 2017
CS402- Theory of Automata
Total Marks: 20
Due Date: 03/05/2017
Instructions
It should be clear that your assignment will not get any credit  if:
o        The assignment is submitted after due date.
o        The submitted assignment does not open or file corrupt.
o        The assignment is full or partially copied from (other student or ditto copy from handouts or internet).
o        Student ID is not mentioned in the assignment File or name of file is other than student ID.
o        The assignment is not submitted in .doc or .docx format.

`Your submission must include:`
• Assignment should be in .doc or .docx format.
Assignment submission through email is NOT acceptable

## Objective

The objective of this assignment is
o   To give knowledge and understanding of Regular Expression.
o   To be able to understand and draw the Finite Automata (FA).
Note:
·          Font style: “Times New Roman”
·          Font color: “Black”
·          Font size: “12”
·          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 # 01 – 08
Question No: 01 (Marks:  10)
Consider QUOTE <v:shape id="_x0000_i1026" type="#_x0000_t75" style='width:47.25pt;height:13.5pt' equationxml="

14Î£={0,1}”>  <v:shape id="_x0000_i1027" type="#_x0000_t75" style='width:47.25pt;height:13.5pt' equationxml="

14Î£={0,1}”> <!–[if supportFields]><![endif]–>; Draw transition table from following transitions.

At state x reading zero, go to state y
At state x reading 1, go to state z
At state y reading 1, go to state z
At state y reading 0, stay at y
At state z reading (0,1) stay at z
Note: x, y, z are the states where x is initial state and z is final state.
Question No. 02 (Marks:  10)
Draw an FA for the following finite language defined over alphabet set {0, 1} accepting the given words.
{^, 01,10,010,101}
Note: Do not draw the null state.
=====================================Ended=======================================
For any query about the assignment, contact at CS402@vu.edu.pk
GOOD LUCK
Solution:
Don’t copy, write your own style