An ___________ can be considered to be an intermediate structure between Finite automaton and Transition Graph.

• A) None of the given options
• B) GTG
• C) NFA
• D) RE

We have FA accepting the language L, now if we are going to find the complement of L, then we should:

• A) Change FA final states into non final states
• B) Only change FA old final states into non final states
• C) Change FA non final states into final states
• D) Change FA non final states into final and final states into non final states

Melay machine to increase the output string in magnitude by 1 is called:

• A) Decrementing machine
• B) Incrementing machine
• C) Converting machine
• D) Complementing machine

Melay machine can have -------- final states.

• A) One
• B) More than one but infinite
• C) More than one but finite
• D) Zero

Set of all palindromes over {a b} is regular.

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

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

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

The strings or words which do not belong to a language are called ________ of that language.

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

a^n b^n generates the ___ language.

• A) regular
• B) non regular
• C) EQUAL and non regular
• D) EQUAL and regular

Let L be the language of all strings, defined over Σ = {0,1}, ending in 111. Which of the following strings are indistinguishable with respect to L with z being 11?

• A) 100, 101
• B) 010, 101
• C) 110, 101
• D) 111, 101

The grammatical rules which involves meaning of words are called:

• A) Semantic
• B) Syntactics
• C) Alphabets
• D) None of the given options

In concatenation, we include the initial state of FA2 automatically after the final state of FA1 because of:

• A) We need just one initial state
• B) The strings of FA2 are accepted first before the strings of FA1
• C) Some part of the string may be accepted by FA2
• D) We need just two initial states

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