Question: If an alphabet has n number of letter, then number of strings of length m will be?

• 1. n+m
• 2. (n)(m)
• 3. m^n
• 4. n^m

Question: One FA has 3 states and 2 letters in the alphabet. Then FA will have __ number of transitions in the diagram.

• 1. 4
• 2. 5
• 3. 6
• 4. 7

Question: “One language can be expressed by more than one NFA”. This statement is __.

• 1. True
• 2. False
• 3. Depends on NFA
• 4. None of the given

Question: In GTG, if a state has more than one incoming transitions from a state. Then all those incoming transitions can be reduced to one transition using __ sign.

• 1. –
• 2. +
• 3. *
• 4. None of the given

Question: GTG can have __ final state.

• 1. 0
• 2. 1
• 3. More than 1
• 4. All of the given

Question: Above given FA accepts the language in which strings?

• 1. Begins with and ends in same letter
• 2. Begins with and ends in different letter
• 3. Has length more than 2
• 4. None of the given

Question: If a language can be expressed through FA, then it can also be expressed through TG?

• 1. True
• 2. False
• 3. Depends on language
• 4. None of the above

Question: If r1 = (aa + bb) and r2 = ( a + b) then the language (aa + bb)* will be generated by?

• 1. (r1)(r2)
• 2. (r1 + r2)
• 3. (r2)*
• 4. (r1)*

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

• 1. Λ
• 2. abba
• 3. aabbbaa
• 4. bbaab

Question: Languages generated by kleene star are always __.

• 1. Finite
• 2. Infinite
• 3. Sometimes finite & sometimes infinite
• 4. None of the these