CS 402 Subjective Paper My today paper on dated 13-5-2011 Most of MCQ comes from previous papers Question: If a language

can be accepted by an ! t"en it can be accepted by #$ as %ell& '"at are t"e t%o statement of (leens)s t"ermo* +Mar,s 2Question: .o% can %e ma,e ! from a language and also a language from !* +Mar,s 2Question: /rove t"e follo%ing statement* +Mar,s 3or every Moore mac"ine t"ere is a Mealy mac"ine t"at is e0uivalent to it1 Question: #"ere are different %ays to prove (leen)s #"ermo /art-III2 one met"od is t"roug" union of t%o !)s1 3ame ot"er t%o met"ods 43ame only5* +Mar,s 3Question: 6escribe t%o different met"od of converting 3 ! to !1 +Mar,s 5Question: 'rite do%n t"e 78)s for t"e follo%ing language1 +Mar,s 5a5 9igma:;0&1< "aving all possible string e=cept 3>?? string1 b5 9igma:;0&1< "aving @0110A any%"ere in t"e string1 c5 d5 Q10 e5 ?et !3 be an ! corresponding to !1 !2& t"en t"e initial state of !3 must correspond to t"e initial state of f5 C"oices: g5 !1 only "5 !2 only i5 !1 or !2 B5 !1 and !2 k) 1.make FA of and NFA the link of image of NFA is...image was given in paper mark 5 l5 '"at #ransition meant in inite !utomata * 3 mar,s m5 '"at is 1st step of %riting 78 * 3 mar,s CS 402 Current Paper 2012 Q. Make FA from given NFA. 3marks Q. Point of K een !"eor#. Q. $iffern%e an& %ommon '() NFA * $FA Q.Make regu ar e+pression of t"e FA 1)what is the function of mealy machine? 2)write regular e pression for the !0"1# such that there shoul$ not be triple bbb in any string? %)write the first step to convert &'& to ()?

4)e plain with e ample that how in &'&*s we $irectly join the initial state with the final state? +,1 Chec- the given statements or correct or not if not then correct it. 1. String in regular language can not be infinite 2. Concatenation of finite letters from alphabets calle$ sigma %. 'here cannot be more then on ()"s for same language. +,2./hat is the $ifference between the strings an$ the wor$s of a language? +,%. 0s there any $ifference in P)10234567 an$ reverse of palin$rome e plain it? +,4.()1 an$ ()2 were given an$ an 2() was re8uire$ correspon$ing to these ()s? +,9.) '& was given an$ it was re8uire$ to re$uce it? +,: e plain 6oor 6achine? 1. String in regular language can not be infinite 2. Concatenation of finite letters from alphabets calle$ sigma $ear all statements are not correct because 1)strings can be infinite an$ in 2) it is calle$ string %)there may be one or more ()*s for same language. +,1 Chec- the given statements or correct or not if not then correct it. 1. String in regular language can not be infinite 2. Concatenation of finite letters from alphabets calle$ sigma %. 'here cannot be more then on ()"s for same language. +,2./hat is the $ifference between the strings an$ the wor$s of a language? +,%. 0s there any $ifference in P)10234567 an$ reverse of palin$rome e plain it? +,4.()1 an$ ()2 were given an$ an 2() was re8uire$ correspon$ing to these ()s?

+,9.) '& was given an$ it was re8uire$ to re$uce it? 1atest paper on 19th may +. /hat are the $ifference ; similarities b<w () ; 2()? +.=ow can we show transition table of 2() to ()? +.0s >leen*s star ; >leen*s closure are $ifferent? +. /hat is the $ifference b<w 6ealy ; 6oore machine? +./rite a regular e pression of length : which starts an$ en$ with the same $ouble letters? +.write regular e pression of string containing 111 5r 11 having no 1 e cept that ? CS 402 Current Paper 2012 +. 6a-e () from given 2(). %mar-s +. Point of >leen 'heory. +. 3iffernce an$ common b<w 2() ; 3() +.6a-e regular e pression of the () 1atest paper on 19th may +. /hat are the $ifference ; similarities b<w () ; 2()? +.=ow can we show transition table of 2() to ()? +.0s >leen*s star ; >leen*s closure are $ifferent? +. /hat is the $ifference b<w 6ealy ; 6oore machine? +./rite a regular e pression of length : which starts an$ en$ with the same $ouble letters? +.write regular e pression of string containing 111 5r 11 having no 1 e cept that ? +uestion? 0f a language can be accepte$ by an () then it can be accepte$ by '& as well" /hat are the two statement of >leens@s thermo? A6ar-s 2B +uestion? =ow can we ma-e () from a language an$ also a language from ()? A6ar-s 2B +uestion? Prove the following statement? A6ar-s %B (or every 6oore machine there is a 6ealy machine that is e8uivalent to it. +uestion? 'here are $ifferent ways to prove >leen@s 'hermo PartC000D one metho$ is through union of two ()@s. 2ame other two metho$s E2ame only)? A6ar-s %B

+uestion? 3escribe two $ifferent metho$ of converting 2() to (). A6ar-s 9B +uestion? /rite $own the 47@s for the following language. A6ar-s 9B a) SigmaF!0"1# having all possible string e cept 2G11 string. b) SigmaF!0"1# having H0110I anywhere in the string. 1./hy we nee$ 2() if (a is available give soli$ reasons. 2.ma-es a 47 for a langauge $oes not have triple b orEbbb) at any place. 2+ of 9mar-s 1.ma-e () of an$ 2() the lin- of image of 2() is603 P)P74 5( CS402 12<9<2011 '=)2>S 2 )njum 4ea$ the given statement Jes<2o justify your answer why?...................... A%B 0s 47 infinite? )n alphabet is concatenation of letters an$ is also calle$ sigma? )ll ()@s are also 2() or not )ny onther way to represent the final EK) an$ initialEC) states?..................A2B ) regular language 1 has only en$ing with H01I are these belonge$ to?....A2B Lustify why H1101I an$ H111011I ()1K()2F()1G()2MMMMMMMMMMMMMMMMMMMMMMM MMMMMMMMM.A9B 7 plain 6oore 6achineMMMMMMMMMMMMMMMMMMMMMMMMMMMM..M A9B 3ifferent between wor$ an$ strings? 2 mar-s

/hat is 'ransition? 2 mar-s

3ifferent between 3istinguishable strings an$ in$istinguishable strings? % mar-s

7 plain 6ealy machine ? % mar-s

2() correspon$ing to the Closure of an ()

9 mar-s

'&s? accepting all strings" accepting none" starting with b" not en$ing in b" containing aa" containing aa or bbMM.. 9 mar-s 3ifferent between wor$ an$ strings? 2 mar-s /hat is 'ransition? 2 mar-s 3ifferent between 3istinguishable strings an$ in$istinguishable strings? % mar-s 7 plain 6ealy machine ? % mar-s 2() correspon$ing to the Closure of an () 9 mar-s '&s? accepting all strings" accepting none" starting with b" not en$ing in b" containing aa" containing aa or bbMM.. 9 mar-s /hat 6ealy 6achine will $o 0f SigmaF0011000 /hat is value Sigma an$ &amma? /hat will be the final result of that given sigma.

1. /rite at least one similarity an$ one $ifference between 3() ; 2() 2. 5ne 8uestion was about mealy machine. (ollowing machine was shown with following 8uestions

a. /hat is N an$ O for this machine b. /hat will be output of this machine if 110001101 is input c. 3escribe the purpose of this machine 1. Py loo-ing at transition $iagram" how can we i$entify whether it is () or '& 2. 3ifferentiate ()"'& ; &'& %. 6C+? /hat is 47 of following $iagram

1. 6C+? =ow many wor$s will be there for language of n characters with m length 1. nKm" nQm" nm" none 2. 6C+? /hat is 47 of 7R72C7R72 machine %. 6C+? =ow many minimum no$es are re8uire$ in 2() of 533 language 3ifferent between wor$ an$ strings? 2 mar-s /hat is 'ransition? 2 mar-s 3ifferent between 3istinguishable strings an$ in$istinguishable strings? % mar-s 7 plain 6ealy machine ? % mar-s

2() correspon$ing to the Closure of an () 9 mar-s '&s? accepting all strings" accepting none" starting with b" not en$ing in b" containing aa" containing aa or bbMM.. 9 mar-s cs402 current papr 6ultiple choice 20 mar-s """" 3ifferent between wor$ an$ strings? 2 mar-s /hat is 'ransition? 2 mar-s 3ifferent between 3istinguishable strings an$ in$istinguishable strings? % mar-s 7 plain 6ealy machine ? % mar-s 2() correspon$ing to the Closure of an () 9 mar-s '&s? accepting all strings" accepting none" starting with b" not en$ing in b" containing aa" containing aa or bbMM.. 9 mar-s can we represent start an$ final state with K an$ C sign an$ is there any other way to represent it?? 1./hy we nee$ 2() if (a is available give soli$ reasons. 2.ma-es a 47 for a langauge $oes not have triple b orEbbb) at any place. 2+ of 9mar-s 1.ma-e () of an$ 2() the lin- of image of 2() is...image was given in paper 2. how we can re$uce the more then one transitions e$ges into one transition e$ge e plain with an e ample.

name the four $iagrams use$ in aotomata..............2 what is -leen*s star closure....................................2 3istinguishable an$ in$istinguishable strings...........% 3raw 2() for.. statement nai ya$..........................% 3raw 2() from given ()......................................9 convert given 2() into ()....................................9 '"at is (leenCs star of t"e 1A I, diagram ti #$ ,i@ 5 mar,s '"at is (leen star ** I, ! banana ta Bs m sirf i, @0A accept ,ry r 3 states ma=imum "un1** 3 Mar,s a5 'rite t"e recursive definition of t"e follo%ing language1 +D? : 6efining t"e language ;a2n bEn <& n:1&2&3&F & of strings defined over G:;a& b< b5 'rite a regular e=pression of t"e language "aving strings t"at eit"er start or end %it" @00A and "ave no more Heroes1 '"ere t"e alp"abet is ;0& 1<1 +EQuestion No. 9 a5 6efine 3 !-null1 b5 6ra% 6 ! for t"e follo%ing 3 !1 Question No. 12 aaI : aJ * 6ifferentiate bet%een t"e follo%ing terms: Mealy and Moore mac"ine1 3 ! and !1 Kuild an ! corresponding to 3 ! given belo%1

Kuild an 3 ! e0uivalent to !1> !2& %"ere !1& !2 are given belo%1

Marks : 10 ind t"e regular e=pression associated to t"e follo%ing !1 9"o% all steps1 +.int: use ! to $#$ and $#$ to 781-