COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]


((q, y), a)


(*(q, y), a)


(q, ya)


independent from notation

Detailed explanation1: 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 explanation2: 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 explanation3: 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 nonfinal states to final and final state to nonfinal keeping the initial state as it is. Hence, 4 states will be required.
Detailed explanation4: 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.