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

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