If we subtract a binary number 1010 from the binary number 1101(ignore the overflow), then the result will be:

• A) 1100
• B) 1010
• C) 0010
• D) 0011

Two languages are said to belong to same class if they end in the same state when they run over an FA and that state ___.

• A) Must be final state
• B) May be final state or not
• C) May be start or not
• D) None of the given options

Let FA1 accepts many strings and FA2 accepts no string, then FA1+FA2 will be equal to:

• A) FA2
• B) FA2-FA1
• C) FA1
• D) (FA2)*

If we have an NFA having 3 states, and we convert that NFA to an FA. The resultant FA will contains _______ states.

• A) 5
• B) 2
• C) 3
• D) 4

According to Myhill Nerode theorem if L generates finite no. of classes then L is ___.

• A) Finite
• B) Infinite
• C) Regular
• D) Non Regular

A string will be accepted by an NFA if there exists _______ one successful path.

• A) atmost
• B) maximum
• C) none of the given options
• D) atleast

If the intersection of two regular languages is regular then the complement of the intersection of these two languages is also regular.

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

Let FA3 be an FA corresponding to FA1FA2, then the final state of FA3 must correspond to the final state of

• A) FA1 only
• B) FA1 or FA2
• C) FA1 and FA2
• D) FA2 only

In pumping lemma theorem (x y^n z) the range of n is ___.

• A) n=1
• B) 2
• C) 3
• D) 4 ...

------------ 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