Friday, October 14, 2011
Tuesday, September 20, 2011
TOC solutions Paper3
Let ∑={0,1} design NFA
Q.1. (a)
(i) {w:w = x01 where x has exactly one 1 and any number of zeros}
(ii){w : every odd position is a one}
(iii){w : w contains either the substring 000 or 010}
(b)Design a TM for accepting the language {anbncn : n>=1}
Q.If L is a regular language,need perm(L) be regular.Justify
Solution-
Sunday, September 4, 2011
Monday, August 1, 2011
Friday, July 15, 2011
Solved question papers
PAPER-2(dec-2006)
UGC NET solved question paper -
Corrections-answer to Q.11 is c
If you have any query regarding answers then discuss it here
UGC NET solved question paper -
Corrections-answer to Q.11 is c
If you have any query regarding answers then discuss it here