# CS402 Assignment No 01 Solution Fall 2016

### CS402 Assignment No 01 Fall 2016

Here You can download VU Theory of Automata - CS402 Assignment with Solution. CS402 theory of automata Assignment No 01 Solution and Discussion Due Date:16-11-2016.

### CS402 Assignment 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.

• Assignment should be in .doc or .docx format.
• Assignment submission through email is NOT acceptable

### CS402 Assignment Objective

The objective of this assignment is
To give knowledge and understanding of Regular Expression.
To be able to understand and draw the Finite Automata (FA).

### CS402 Assignment 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

### CS402 Assignment Question No: 01

(Assignment  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.

(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.

### CS402 Assignment Question No. 02

(Assignment Marks: 10)

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

CS402 Assignment No 01 Solution

### CS402 Assignment Question No. 01 Solution:

(a) Write a regular expression for the language over an alphabet Î£ = {u, v} in which all strings do not end with uu.

Solution:
RE = L + 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 *

### CS402 Assignment Question No. 02 Solution:

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

Solution:
 Cs402 Assignment No. 1 Question no 2 Solution

Cs402-Automata.pdf, 429 KB
Cs402 Automata idea solution.DOCX, 34 KB

You Can Also Download Solved Mid Term Papers, Short NotesLecture Wise Questions Answers Files, Solved MCQs, Solved Quiz , Solved Mid Term Subjective Papers , Solved Mid Term Objective Papers From This Discussion For Preparation Mid Term Papers of Fall 2015-16.

### Zohaib khan

He is a Content Creator SEO Expert, Web Designer and a Pro Blogger. You can Follow him @ Google+.