CS402 Final Term Current Paper (Feb 2011)
Saturday, May 14, 2011 Posted In .Midterm May 2011 Edit This
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]
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]
