CS402 assignment no 1 Spring 2011 Idea solution by vuhelp on 12 April

[Xpert]

View more random threads:

• CS408 Human Computer Interaction Assignment No.1 Solution...
• CS304 Assignment no 3 Solution 20th January 2016
• CS502 assignment no 2 spring 2011
• IT430 E-Commerce Assignment No.2 Solution Fall Semester 2012
• IT430 E Commerce Assignment No. 02 Semester idea solution ...
• first semester assignment of cs604 spring may 2015 with...
• CS602 Computer Graphics Assignment No.1 Solution Spring...
• CS408 Human computer Interaction assignment no 1 fall April...
• CS402 Quiz # 2
• CS601 Assigenment No.2 Solution Fall Smaster 2012

Question No.1
RECURSIVE DEFINITION
a. Give recursive definition of language defined over alphabet Σ = {a, b}, having all
strings STARTING WITH aa OR ENDING WITH bb
b. Give recursive definition of language defined over alphabet Σ = {a, b}, having all
strings with length MULTIPLE OF 2
c. Give recursive definition of language defined over alphabet Σ = {a, b}, having all
strings NOT ENDING with aa or bb
d. Give recursive definition of language defined over alphabet Σ = {a, b}, NOT
HAVING ab at any place.
e. Give recursive definition of ODD PALINDROME (PALINDROME WITH
ODD STRINGS ONLY) defined over alphabet Σ = {a, b}
Question No.2
REGAULAR EXPRESSIONS
Give Regular Expression for each of the following language defined over alphabet Σ =
{a, b}
a. Language having all strings STARTING AND ENDING WITH ab
b. Language of strings NOT having bb OR aa at any place
c. Language of all strings NOT HAVING aab in start
d. Language of all strings NOT HAVING aab in end
e. Language of all strings HAVING count of b’s multiple of 2 [No restriction on
count of a]
Question No.3
FINITE AUTOMATA
Give Finite Automata for each of the following language defined over alphabet Σ = {a, b}
a. Language having all strings with alternating a’s and b’s , some example strings
are ababab… or bababa…
b. Language having all strings NOT containing aa at any place
c. Language of all strings NOT STARTING with bb
d. Language of all strings STARTING WITH bba
e. Language having all strings NOT having even no of a’s and b’s

Sponsored Links

[moon13]

Please upload the correct solution of this assignment i try my level best to solve it but no success so please help me immadiatly

[Xpert]

hmmm.... well you can discuss this with us... it will be better.

[haseebsarwar42]

plz plz plz plz plz give me Solution
haseebsarwar42@yahoo.com

[salwa arshad]

plz give the solutionnnn plzzzzzz

[vukhan]

your name and gender?

[rahamdil]

hmmm.... well you can discuss this with us... it will be better.

I need help please Xpert help me. I will be thankful to you.

[Xpert]

I will try to post it dear. Just wait.

[Vuhelper]

full solution in attachment


Step 1: a and b are in language L
Step 2: a(s)or b(s) is also in language L, Where s belongs to å*
Step 3: No strings except those constructed in above, are allowed to be in L
(b) Step 1: a and b are in Language L
Step 2: (s)b is also in language L, Where s belongs to å*
Step 3: No strings except those constructed in above, are allowed to be in L
(c) Step 1: a and b are in Language L
Step 2: (s)b is also in language L, Where s belongs to å*
Step 3: No strings except those constructed in above, are allowed to be in L
(d) Step 1: a and b are in Language L
Step 2: aa(s) or (s)aa(s) or (s)aa is also in language L, Where s belongs to å*
Step 3: No strings except those constructed in above, are allowed to be in L
(e) Step 1: a and b are in Language L
Step 2: b(s)ba is also in language L, Where s belongs to å*
Step 3: No strings except those constructed in above, are allowed to be in L

[moon13]

it is different as compare with current assignment