Moore Machine is an application of:

• A) None of the mentioned
• B) Finite automata without input
• C) Finite automata with output
• D) Non- Finite automata with output

Left hand side of a production in CFG consists of:

• A) One terminal
• B) More than one terminal
• C) One non-terminal
• D) Terminals and non-terminals

In which of the following machine, the length of output string is 1 more than that of input string?

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

PDA is only used to represent a regular language.

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

The length of output string in case of _________ is one more than the length of corresponding input string.

• A) Incremental machine
• B) Adding Machine
• C) Mealy machine
• D) Moore machine

In Moore machine, if the length of input string is 9, then the length of output string will be:

• A) 8
• B) 9
• C) 7
• D) 10

We can find a CFG corresponding to a DFA.

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

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

• A) 010, 101
• B) 111, 101
• C) 001, 101
• D) 111, 111

NFA with null string has ---------- initial state(s).

• A) Many
• B) One
• C) Two
• D) Three

A CFG is said to be ambiguous if there exists at least one word of its language that can be generated by different production trees.

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

In _______ there must be transitions for all the alphabets over which a language is defined.

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

Syntax tree or Generation tree or Derivation tree are same tree.

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

While developing NFA for the union of FA1 and FA2, there will be _____________ transition/transitions for both ‘a’ and ‘b’ on the new initial state.

• A) Multiple
• B) Only one
• C) Single
• D) Only three

Which of the following doesn't accept any language?

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

The production of the form non-terminal to one non-terminal is called unit production.

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

We cannot construct an NFA for the language of ______ defined over alphabet set {a,b}.

• A) Even even
• B) Integers
• C) Palindromes
• D) odd

DFA and PDA are equal in power.

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

Given the language L = {ab, aa, baa}, which of the following strings are in L*?
1) abaabaaabaa
2) aaaabaaaa
3) baaaaabaaaab
4) baaaaabaa

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

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

Semi-word is a string having some terminals and one non-terminal at the right of string.

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