We have been working very hard since 2009 to facilitate in your learning Read More. We can't keep up without your support. Donate Now.

www.vustudents.ning.com

 www.bit.ly/vucodes + Link For Assignments, GDBs & Online Quizzes Solution www.bit.ly/papersvu + Link For Past Papers, Solved MCQs, Short Notes & More

Looking for Something at Site? Search Below

# Assignment No. 1 of CS402 has been uploaded. The due date to submit the assignment is May 17th, 2016

 Assignment No. 01 Semester: Spring 2016 Theory of Automata – CS402 Total Marks: 20   Due Date:  17/05/2016 Objectives: Objective of this assignment is to assess the understanding of students of Sets, Alphabets, Languages, Regular Expression and Finite Automata.   Instructions: Please read the following instructions carefully before submitting assignment: You should consult the recommended books, PowerPoint slides and video lectures to clarify your concepts. You are supposed to submit your assignment in .doc format. Any other formats like scan images, PDF, zip, rar and bmp etc will not be accepted. It should be clear that your assignment will not get any credit if: The assignment is submitted after due date. The assignment is copied from Internet or from any other student. The submitted assignment does not open or file is corrupt.   Note: No assignment will be accepted after the due date through email in any case (load shedding, server down, internet malfunctioning etc.). It is recommended to upload solution file at least two days before its closing date.   For any query about the assignment, contact at cs402@vu.edu.pk   Question 1:                                                                                                                              Marks:5+5 10 Write regular expression for each of the following languages over alphabet set {a,b}.   I)                   Language of all those strings which end with substring ‘ab’ and have odd length. II)                Language of all those strings which contain no more than two b’s.      Question 2:                                                                                                                               Marks: 10 You are required to construct an FA for the language of all those strings whose length is Odd, but contain even number of b’s defined over alphabet set {a,b}. BEST OF LUCK

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

Views: 3534

Attachments:

### Replies to This Discussion

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.

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

I)                Language of all those strings which end with substring ‘ab’ and have odd length.? plz send odd lenght

A string should be ended at ‘ab’ and should have odd length.
Regular expression for an odd length string is (a+b)((a+b)(a+b))* or ((a+b)(a+b))*(a+b)
By increment ab string in the end which have odd length.
(((a+b)((a+b)(a+b))*)+(((a+b)(a+b))*(a+b)))ab

but question no.1 ke second juz ka dia gram make make krna kiay,

by

mc160201929

Attachments:

Question 1: Marks:5+5 10
Write regular expression for each of the following languages over alphabet set {a,b}.

Language of all those strings which end with substring ‘ab’ and have odd length.
((ab+ba)(aa+bb)(ab+ba))*
Language of all those strings which contain no more than two b’s.
(a+b)(a+b)(a+b)*

Question 2: Marks: 10
You are required to construct an FA for the language of all those strings whose length is Odd, but contain even number of b’s defined over alphabet set {a,b}.

a a a
b b b

Is an FA with odd length n even no.of strings defined over alphabet [a,b]

Its regular expression may be:

(a+b)(a+b)(a+b)

these are wrongs

Language of all those strings which end with substring ‘ab’ and have odd length.

bro ye question no.1 ke second juz main dia gram make krna he

kia check example

Attachments:

Question 1: Marks:5+5 10
Write regular expression for each of the following languages over alphabet set {a,b}.

Language of all those strings which end with substring ‘ab’ and have odd length.
((ab+ba)(aa+bb)(ab+ba))*
Language of all those strings which contain no more than two b’s.
(a+b)(a+b)(a+b)*

Question 2: Marks: 10
You are required to construct an FA for the language of all those strings whose length is Odd, but contain even number of b’s defined over alphabet set {a,b}.

a a a
b b b

Is an FA with odd length n even no.of strings defined over alphabet [a,b]

Its regular expression may be:

(a+b)(a+b)(a+b)

solve assignment of CS402 .

Attachments:

Language of all those strings which contain no more than two b’s.

## HELP SUPPORT

This is a member-supported website. Your contribution is greatly appreciated!

## Latest Activity

Faraz smile mscs updated their profile
1 hour ago
+!!! Slow poison!!! liked Shanzay's discussion Kyaa Khuda B Ussi Ka Tha....
2 hours ago
2 hours ago
3 hours ago
3 hours ago
+ıllıllı ᎶᏋᏁᎥᏬᏕ ᏰᎥᏒᎴ ıllıllı+ posted discussions
3 hours ago
3 hours ago
3 hours ago

1

2

3