The CFG is said to be ambiguous if there exist at least one word of its language

that can be generated by the ���� production trees

1.One
2.Two
3.More than one At most one
C

2 In a STACK
The element PUSHed first is POPed first
The element PUSHed first is POPed in the last
The element PUSHed in last is POPed in last
None of given options

3. Consider the following CFG: (NOTE: ^ means NULL) S->a|Xb|aYa X->Y|^ Y->b|X
Which Nonterminal(s) is/are NOT nullable
S
X
Y
S,X and Y

4 If a CFG has only productions of the form nonterminal -> string of two
nonterminals or nonterminal -> one terminal then the CFG is said to be in _________

PDA form
Chomsky Normal Form (CNF)
NULL able form
Unit production form

5 The structure given below is called _________ S -> aA|bB A -> aS|a B -> bS|b
RE
TG
CFG
PDA

6 (a* + b*)* = (a + b)* this expression is __________

True
False
NA
NA B

7 The states in which there is no way to leave after entry are called
Davey John Lockers
Dead States
Waste Baskets
All of the given options

8 If S = {ab, bb}, then S* will not contain

Abbbab
Bbba
ababbb
bbbbab

9 According to theory of automata there

1
2
3
4

10 What do automata mean?

Something done manually

Something done automatically
Both of these
None of these
B

11 What is false about the term alphabet?

It is a finite set of symbols
It is usually denoted by Greek letter sigma
It can be an empty set
Strings are made up of its elements
C

12 Formal is also known as _________

Syntactic language
Semantic language
Informal language
None of these
A

13 Kleene star closure can be defined

Over any set of string
Over specific type of string
Over any set of language
Over specific type of language
A

14 While finding RE corresponding to TG, we connect the new start state to the
old start state by the transition labeled by
A
B
null string
None of the given options
C

15 (a* + b*)* = (a + b)* this expression is __________

True
False
NA
NA
B

16 The states in which there is no way to leave after entry are called
Davey John Lockers
Dead States
Waste Baskets
All of the given options
D

18 According to theory of automata there are _________ types of languages

1
2
3
4
B

19 A DFA with n states must accept at least one string of length greater than n

True
False
NA
NA

20 S={a,Aa,Abb}, then string aAaAbbAa has ________ length

1
2
3
4
D

21 Languages generated by kleene star are always __________

Finite
Infinite
Sometimes finite & sometimes infinite
None of the these
B

22 Let S = {aa, bb} be a set of strings then s* will have

?
abba
aabbbaa
bbaab
A

23 If r1 = (aa + bb) and r2 = ( a + b) then the language (aa + bb)* will be

generated by
(r1)(r2)
(r1 + r2)
(r2)*
(r1)*
B

24 If a language can be expressed through FA, then it can also be expressed

through TG
True
False
Depends on language
None of the above
A
25 Above given FA accepts the language in which strings
Begins with and ends in same letter
Begins with and ends in different letter
Has length more than 2
None of the given
A

26 GTG can have _______________ final state

0
1
More than 1
All of the given
D