# Fall 2016_CS402_1

 Semester:     Fall 2016 Assignment No. 01SEMESTER Fall 2016CS402- Theory of Automata Total Marks: 20Due Date: 16 Nov 2016

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 - 09

Question No: 01 (Marks:  05 + 05)

(a)   Write a regular expression for the language over an alphabet Σ = {u, v} in which all strings do not end with uu.
Solution : RE = /\ + u + v + (u+v)* (uv+vu+vv)
(b)   Write a regular expression for the language over an alphabet Σ = {m, n} in which all strings have number of m’s divisible by 2.
Solution : RE = n*(mn*mn*)*  OR    (n + mn*m)*    OR    (n*mn*m)*n*
Question No. 02 (Marks:  10)

Draw (Build) the FA for the language described in question no. 1 part (a).

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

GOOD LUCK

Solution File :

#### Virtual Ning

Welcome to Our WebSite! - | Virtual Ning | Pakistan NO # 1 . Website for the Students of Virtual University.

Next
Previous