Solution of CS402 Assignment No. 02 Fall 2012

On Wed, Nov 28, 2012 at 5:49 PM, virtualians <irfankhan0044@gmail.com> wrote:

Asslam.o.alaikum

Dear students Complete Solution of CS402 Assignment No. 02 Semester Fall 2012 has posted 

Q. No. 1 Construct Non-Deterministic Finite Automaton (NFA) from the concatenation of the following two languages:                                         

                                                           

a. Language of all strings defined over Σ = {0, 1} whose length is even and number of 1’s are odd.

 

 

someone plz give at least RE

 

 

b. Language of all strings defined over Σ = {0, 1} whose second last letter is 1.

 

RE:  (0+1)*(11+10)

and FA

                                                                                                           Marks [5+5+5]

Hint: First construct FA for the given languages and then construct NFA from their concatenation.                                                                                 

 

 

 

 

Q. No. 2 Construct a Finite Automaton (FA) for the language of all strings defined over Σ = {0, 1} that ends with substring “01” and have odd length.

My Openion

RE: (0+1)((0+1)(0+1))*01

FA

Marks [5]

Thanks and Regards

www.virtualians.pk team

--
--
For Virtual University of Pakistan Study Material Sharing, Discussion, etc, Come and join us at http://4e542a34.linkbucks.com
You received this message because you are subscribed to the Google
Groups "Virtual Position" group.
To post to this group, send email to virtualposition@googlegroups.com
For more options, visit this group at
http://004bbb67.any.gs
 
 
 

--

-- 
For University of Pakistan Study Material Sharing, Discussion, etc, Come and join us at http://4e542a34.linkbucks.com
You received this message because you are subscribed to the Google
Groups "Study" group.
To post to this group, send email to http://ca13054d.tinylinks.co
For more options, visit this group at
http://004bbb67.any.gs