------------ can also help in proving Kleene Theorem III.

• A) NFA
• B) Moore machine
• C) PDA
• D) Melay machine

Which of the following is used to delay the transmission of signal along the wire by one step (clock pulse)?

• A) Slow box
• B) Reduce box
• C) Holdup box
• D) Delay box

For a non regular language there exist ___ FA.

• A) One
• B) At least one
• C) At most one
• D) No

Strings x,y,z belongs to Σ * such that xz ∈ L but yz ∉ L where L ⊆ Σ* are:

• A) Both distinguishable and indistinguishable
• B) Indistinguishable
• C) Undetermined
• D) Distinguishable

The strings or words which do not belong to a language is called ___ of that language.

• A) Intersection
• B) Union
• C) Complement
• D) Quotient

A _______ with "n" states must accept at least one string of length greater than "n".

• A) DFA
• B) Irrelevant language
• C) Irregular language
• D) RE

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

• A) No final and initial states in FA1 and FA2 respectively
• B) No initial and final states in FA1 and FA2 respectively
• C) No final state in FA2 only
• D) No initial state in FA1 only

In NFA,if null word (lambda) is allowed to be a label of an edge, then that NFA is called _________.

• A) NFA with one string
• B) NFA without null string
• C) NFA with null string
• D) NFA with two strings

If an FA accept a word then there must exist a path from ___.

• A) Initial to final state
• B) Initial to each state
• C) Initial to each state but not to final state
• D) Initial to final state by traversing each state

Every NFA can be considered to be a -------- as well, but the converse may not be true.

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

Every _______ can be considered to be ______ as well, but the converse may not be true.

• A) NFA,FA
• B) FA,NFA
• C) None of the given options
• D) TG,FA

FA corresponding to an NFA can be built by introducing an empty state for a letter having ___.

• A) no transition at certain state
• B) one transition at certain state
• C) two transition at certain state
• D) more than two transitions at certain state

In order to make NFA for the union of FA1 and FA2, the new initial state should be linked to:

• A) initial and final states of FA1 and FA2 respectively
• B) final and initial states of FA1 and FA2 respectively
• C) initial states of both FAs
• D) initial state of FA1 only

FA corresponding to an NFA can be built by introducing a state corresponding to the combination of states, for a letter having

• A) more than one transitions at certain state
• B) one transition at certain state
• C) none of the given options
• D) no transition at certain state

FA and _______ are same except that _______ has unique symbol for each transition.

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

Which of the following state is introduced while developing NFA for the closure of an FA?

• A) An initial state which should be final as well
• B) An initial state with loop for all letters
• C) Simply an initial state
• D) Final state

In order to make NFA for the union of FA1 and FA2, the final state/ states of:

• A) FA2 have a transition to the final state of FA1
• B) both FAs should be left intact
• C) FA1 have a transition to the final state of FA2
• D) both FAs should be linked

The product of two regular languages is __________.

• A) infinite
• B) regular
• C) non-regular
• D) closure of a regular language

A PDA is called nondeterministic PDA if ___.

• A) There are more than one outgoing edges at READ or POP states with one label
• B) There are more than one PUSH states
• C) There are more than one POP states
• D) All of the given options

A language that can be expressed by RE, is said to be a _______ language.

• A) finite
• B) regular
• C) irregular
• D) infinite