# MCQ IN COMPUTER SCIENCE & ENGINEERING

## COMPUTER SCIENCE AND ENGINEERING

### THEORY OF COMPUTATION

 Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
*(q, ya) is equivalent to .
 A ((q, y), a) B (*(q, y), a) C (q, ya) D independent from notation
Explanation:

Detailed explanation-1: -Explanation: Finite automata doesn’t require any stack operation. 10. Number of final state require to accept in minimal finite automata. Explanation: No final state requires.

Detailed explanation-2: -Finite automata have two states, Accept state or Reject state. When the input string is processed successfully, and the automata reached its final state, then it will accept.

Detailed explanation-3: -Since, regular languages are closed under complement, we can first design a DFA that accept strings that surely end in 101. For finding the complement of this DFA, we simple change the non-final states to final and final state to non-final keeping the initial state as it is. Hence, 4 states will be required.

Detailed explanation-4: -2. What is the transitional function of a DFA? Explanation: Q is the finite set and let be a finite set of symbols so Q X fives no of states.

There is 1 question to complete.