Question: If a language is expressed through TG, then that language will have its RE?

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

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

• 1. True
• 2. False
• 3. Can’t be assumed
• 4. None of these

Question: “Every finite language can be expressed by FA”. This statement is __.

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

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