Explore topic-wise InterviewSolutions in .

The correct option is (a) Op(t)=δ(Op(t))

The best I can explain: Op(t)=δ(Op(t)) is the defined DEFINITION of how the output is received on giving a SPECIFIC input to MOORE MACHINE.

The CORRECT CHOICE is (a) Regular

The EXPLANATION is: Regular EXPRESSION are also colsed under intersection.

Correct answer is (d) String of ODD number of 0’s

The explanation: Only d is REGULAR language.

Correct answer is (C) {11, 110} * {0}

The best I can EXPLAIN: The given diagram can be ANALYSED and THUS the option can be seeked.

The correct CHOICE is (a) It can’t remember ARBITRARY large AMOUNT of information.

The explanation: Because there is no memory ASSOCIATED with automata.

The CORRECT OPTION is (d) 64

Best explanation: Number of DFA’s = 2^N * n^(2*n).

The correct ANSWER is (B) 2

The EXPLANATION: Use the equivalence theorem or Myphill Nerode theorem to minimize the DFA.

The CORRECT answer is (d) divisible by 3 and 2

Best EXPLANATION: The given DFA ACCEPTS all the BINARY STRINGS such that they are divisible by 3 and 2.Thus, it can be said that it also accepts all the strings which is divisible by 6.

Right ANSWER is (d) {}

Easiest explanation: Union OPERATION creates the UNIVERSAL set by combining all the elements of FIRST and second set while intersection operation creates a set of common elements of the first and the second STATE.

Right OPTION is (d) All of the MENTIONED

Easiest EXPLANATION: All the optioned mentioned are the instruction formats of how to convert a NFA to a DFA.

The correct answer is (a) Statement: If K is the number of states in NFA, the DFA simulating the same language WOULD have states less than 2^k.

For EXPLANATION: If K is the number of states in NFA, the DFA simulating the same language would have states equal to or less than 2^k.

Correct choice is (a) 6

Easy EXPLANATION: According to the QUESTION, PRESENCE of Q2 or q1 would count so it does and the ANSWER according to the diagram is 6.

Correct answer is (b) 5

The best I can EXPLAIN: STATES, input symbols,initial STATE,accepting state and transition function.

The correct option is (a) ababaabaa

The best EXPLANATION: All the STRINGS are getting accepted EXCEPT ‘ababaabaa’ as it is directed to dumping state. Dumping state also refers to the reject state of the AUTOMATA.

Correct option is (C) Same NUMBER of states as well as transitions

The EXPLANATION is: TWO states are said to be equivalent if and only if they have same number of states as well as transitions.

The correct choice is (B) TRANSDUCERS

For explanation I WOULD say: They are collectively KNOWN as Transducers.

The CORRECT choice is (B) Finite AUTOMATA with output

Explanation: Finite automaton with an output is categorize DIN TWO parts: Moore M/C and Mealy M/C.

The correct choice is (a) 7

Easiest explanation: ∑r= {1,0} and a KLEENE* OPERATION WOULD LEAD to the following set=COUNT{ε,0,1,00,11,01,10} =7.

Correct choice is (b) 2^(3*8)

The EXPLANATION is: 2^(m*n) states REQUIRES .

The correct choice is (a) ACCEPTED by NFA

The BEST I can explain: If L is a regular Language, L^c and L^rboth are regular even.

The correct choice is (d) All of the mentioned

Explanation: There are MANY applications of FINITE AUTOMATA, mainly in the field of COMPILER Design and Parsers and Search Engines.

Correct option is (c) Equal

For explanation: DFA is SAID to be a SPECIFIC case of NFA and for every NFA that exists for a given language, an EQUIVALENT DFA also exists.

The CORRECT choice is (a) Statement: An NFA can be modified to allow transition without input ALPHABETS, along with one or more TRANSITIONS on input SYMBOLS.

For explanation: It is POSSIBLE to construct an NFA with ε-transitions, presence of no input symbols, and that is called NFA with ε-moves.

The CORRECT CHOICE is (d) TYPE 3 language

The best I can EXPLAIN: It is a regular expression.

The CORRECT choice is (a) 16

Explanation: If L leads to FA1, then for L^c, the FA can be OBTAINED by exchanging the FINAL and non-final states.

The correct answer is (a) Q * Σ* -> Q

For EXPLANATION I WOULD say: This takes single state and STRING of input to PRODUCE a state.

Correct choice is (B) {Q1} U {q0, q1, q2}

To explain: δ*(q0,011) = Urϵδ*(q0,01) δ (r, 1) = {q0, q1, q2}.

Right answer is (d) UNCOUNTABLE infinite

Easy EXPLANATION: A language over an alphabet R is a SET of strings over A which is uncountable and infinite.

Correct answer is (b) No

Explanation: Language to ACCEPT a palindrome number or STRING will be non-regular and thus, its DFA cannot be obtained. Though, PDA is POSSIBLE.

Correct ANSWER is (C) Factorial

The best I can EXPLAIN: Factorial, here is the most appropriate non-infinite domain. Otherwise, PALINDROME and reverse have infinite DOMAINS.

Right choice is (a) True

To ELABORATE: REGULAR SETS are closed under these three OPERATION.

Right choice is (c) {Q1, q2}

Best EXPLANATION: ε-closure is defined as the set of states being REACHED through ε-transitions from a starting STATE.

The correct choice is (a) OUTPUT Variations

To explain: MEALY and Moore machine vary over how the outputs depends on PRIOR one (TRANSITIONS) and on the latter one(states).

The correct answer is (a) 100

Explanation: If the STRING is DIVISIBLE by four, it surely ENDS with the substring ‘100’ while a binary string divisible by 2 would surely end with the substring ‘10’.

The CORRECT OPTION is (c) Homomorphism

To explain I would say: This OPERATION REPLACE using a FUNCTION .

The correct OPTION is (a) 1/m^2

Explanation: Running time of DFA: O(N) and Running time of NFA =O(m^2n).

The correct answer is (c) State and Input

For EXPLANATION I would say: DEFINITION of MEALY MACHINE.