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

Question: Σ=,a,Aa,Abb-, then string aAaAbbAa has __ length.

• 1. 1
• 2. 2
• 3. 3
• 4. 4

Question: According to theory of automata there are __ types of languages.

• 1. 1
• 2. 2
• 3. 3
• 4. 4

Question: The states in which there is no way to leave after entry are called?

• 1. Davey John Lockers
• 2. Dead States
• 3. Waste Baskets
• 4. All of the given options

Question: (a* + b*)* = (a + b)* this expression is __.

• 1. True
• 2. False
• 3. NA
• 4. NA

Question: While finding RE corresponding to TG, we connect the new start state to the old start state by the transition labeled by?

• 1. A
• 2. B
• 3. null string
• 4. None of the given options

Question: Kleene star closure can be defined?

• 1. Over any set of string
• 2. Over specific type of string
• 3. Over any set of language
• 4. Over specific type of language

Question: In a STACK?

• 1. The element PUSHed first is POPed first
• 2. The element PUSHed first is POPed in the last
• 3. The element PUSHed in last is POPed in last
• 4. None of given options