A CFG is said to be ambiguous if there exists at least one word of its language that can be generated by different production trees.

• A) True
• B) False
• C) Only sometimes
• D) None of given

In _______ there must be transitions for all the alphabets over which a language is defined.

• A) FA
• B) TG
• C) GTG
• D) NFA

Syntax tree or Generation tree or Derivation tree are same tree.

• A) True
• B) False
• C) Only partially
• D) None of given

While developing NFA for the union of FA1 and FA2, there will be _____________ transition/transitions for both ‘a’ and ‘b’ on the new initial state.

• A) Multiple
• B) Only one
• C) Single
• D) Only three

Which of the following doesn't accept any language?

• A) Deterministic finite state machine
• B) Finite state machine
• C) Moore machine
• D) Regular expression

The production of the form non-terminal to one non-terminal is called unit production.

• A) True
• B) False
• C) Only sometimes
• D) None of given

We cannot construct an NFA for the language of ______ defined over alphabet set {a,b}.

• A) Even even
• B) Integers
• C) Palindromes
• D) odd

DFA and PDA are equal in power.

• A) True
• B) False
• C) Only for regular
• D) None of given

Given the language L = {ab, aa, baa}, which of the following strings are in L*?
1) abaabaaabaa
2) aaaabaaaa
3) baaaaabaaaab
4) baaaaabaa

• A) 2, 3 and 4
• B) 1, 3 and 4
• C) 1, 2 and 3
• D) 1, 2 and 4

In the context of make NFA for the concatenation of FA1 and FA2 (Both FAs accepting null string), which of the following option is correct?

• A) FA2 having final state only
• B) Final states in both FAs
• C) Initial states in both FAs
• D) FA2 having initial state only

Semi-word is a string having some terminals and one non-terminal at the right of string.

• A) True
• B) False
• C) Only sometimes
• D) None of given

Consider we have languages L7 and L6. Which of the following represents their concatenation?

• A) L6*L7
• B) L7+L6
• C) L7/L6
• D) L7L6

Two FAs are equivalent if they have same no. of states.

• A) True
• B) False
• C) Only sometimes
• D) None of given

Which of the following form correctly expressed the regular expression RR*?

• A) R-
• B) R+R-
• C) R*
• D) R+

Mealy machine is equivalent to Moore machine, if we:

• A) Ignore the extra input character inserted by the Mealy machine
• B) Ignore the extra character printed by the Moore machine
• C) Ignore the extra input character inserted by the Moore machine
• D) Ignore the extra character printed by the Mealy machine

Regular languages are closed under Union Concatenation and Kleene star.

• A) True
• B) False
• C) Only Union
• D) None of given

If two finite state machines are equivalent, they should have the same number of ____________________

• A) none of these
• B) states
• C) states and edges
• D) edges

---------- state is not important in Melay machine.

• A) Empty
• B) Initial
• C) Combination of
• D) Final

PDA is stronger than FA.

• A) True
• B) False
• C) Equal
• D) None of given

How many new states are introduced while developing NFA for the closure of an FA?

• A) three
• B) four
• C) two
• D) one