cs402 mid term urrent subjective paper fall December 2011

[Vuhelper]

PAPER#1

Read the given statement Yes/No justify your answer
why?...................... [3]

Is RE infinite?

An alphabet is concatenation of letters and is also called sigma?

All FA’s are also NFA or not

Any onther way to represent the final (+) and initial(-)
states?..................[2]

A regular language L has only ending with “01” are these belonged
to?....[2]

Justify why
“1101” and “111011”

FA1+FA2=FA1UFA2………………………………………………………………………
…………….[5]

Explain Moore
Machine…………………………………………………………………………..…[5]

PAPER#2

All MCQ's are mostly from the old papers and some are common Not
so difficult...

2Q of 2marks
1.can we represent start and final state with + and - sign and is there
any other way to represent it??
2.Sorry yad nahi...
2Q of 3marks
1.Why we need NFA if Fa is available give solid reasons.
2.makes a RE for a langauge does not have triple b or(bbb) at any
place.
2Q of 5marks
1.make FA of and NFA the link of image of NFA is...image was given in
paper
2. how we can reduce the more then one transitions edges into one
transition edge explain with an example.