In Moore machine, output is produced over the change of:

• A) Transitions
• B) States
• C) Transitions and states
• D) None of the mentioned

Chomsky normal form (CYK) algorithm was proposed by ___.

• A) John cock
• B) James Cock
• C) Daniel I.A.
• D) John Weiss

In the context of make NFA for the concatenation of FA1 and FA2 (FA1 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

The language of Palindromes defined over an alphabet set {a b} can be recognized by ___.

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

If new A =1 NAND ( 1 AND 1), then what will be the value of new A?

• A) 10
• B) 1
• C) 0
• D) 01

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

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

(Σ* - L) represent the ___ of a language L.

• A) Complement
• B) Kleene's closure
• C) Union
• D) intersection

Two machines are said to be equivalent if they print the _____ output string when the _____input string is run on them.

• A) unique, different
• B) different, same
• C) same, same
• D) same, different

If we have two transition graphs then their union will be expressed by ___.

• A) taking a common start state and joining them by two null transitions
• B) just connecting both start states by null transitions
• C) connecting final state of first TG to the initial state of second TG
• D) connecting the final state of first TG to the final state of second TG

If L1 and L2 are regular languages then which statement is NOT true?

• A) L1/L2 is always regular
• B) L1 + L2 is always regular
• C) L1 L2 is always regular
• D) L1* is always regular

___ and ___ are removed in order to make a CFG in Chomsky Normal Form (CNF).

• A) Null and nullable productions
• B) Nullable and unit productions
• C) Null and unit productions
• D) String of length 0 and null

In which of the following machine, the length of output string is the same to that of input string?

• A) Finite automaton with output
• B) Moore machine
• C) Non-deterministic finite automaton
• D) Mealy machine

If L1 and L2 are expressed by regular languages then L1 + L2 is also a ___ Language.

• A) Regular
• B) Ir-regular
• C) PDA
• D) Hybrid

The language {a, ab, aba, bab} is __________ .

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

Which one of the following machine is represented as a pictorial representation with states and directed edges labeled by an input letter along with an output character?

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

A read state can have ___ outgoing edge/edges.

• A) 1
• B) 2
• C) 3
• D) Any number of

Which of the following machine has only one initial state and no final state?

• A) Non deterministic finite state machine
• B) Moore machine
• C) Deterministic finite state machine
• D) Finite state machine

Who did not invent the Turing machine?

• A) Alan Turing
• B) A. M. Turing
• C) Turing
• D) None of these

The minimum length of the strings(except null string) of a language that starts and ends in different letters will be:

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

Which statement is true?

• A) The tape of turing machine is infinite
• B) The tape of turing machine is finite
• C) The tape of turing machine is infinite when the language is regular
• D) The tape of turing machine is finite when the language is nonregular