Question 31 : Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then
1. L1
2. L1>=L2
3. L1 U L2 = .*
4. L1=L2
View Answer   Discuss with Members

Question 32 : Regular grammar is
1. Context free grammar
2. Non context free grammar
3. English grammar
4. None of the mentioned
View Answer   Discuss with Members

Question 33 : A language is regular if and only if
1. Accepted by DFA
2. Accepted by PDA
3. Accepted by LBA
4. Accepted by Turing machine
View Answer   Discuss with Members

Question 34 : Which of the following is true?
1. (01)*0 = 0(10)*
2. (0+1)*0(0+1)*1(0+1) = (0+1)*01(0+1)*
3. (0+1)*01(0+1)*+1*0* = (0+1)*
4. All of the mentioned
View Answer   Discuss with Members

Question 35 : How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*?
1. 7
2. 10
3. 12
4. 11
View Answer   Discuss with Members

Question 36 : Which of these does not belong to CFG
1. Terminal Symbol
2. Non terminal Symbol
3. Start symbol
4. End Symbol
View Answer   Discuss with Members

Question 37 : A CFG is closed under
1. Union
2. Kleene star
3. Concatenation
4. None of the mentioned
View Answer   Discuss with Members

Question 38 : A regular Grammar is a?
1. CFG
2. Non CFG
3. English Grammar
4. None of the mentioned
View Answer   Discuss with Members

Question 39 : Push down automata accepts which language
1. Context sensitive language
2. Context free language
3. Recursive language
4. None of the mentioned
View Answer   Discuss with Members

Question 40 : The context free grammar S -> A111|S1, A -> A0 | 00 is equivalent to
1. {0n1? | n=2, m=3}
2. {0n1? | n=1, m=5}
3. {0n1? | n should be greater than two and m should be greater than four}
4. None of the mentioned
View Answer   Discuss with Members