MCQ IN COMPUTER SCIENCE & ENGINEERING

Previous
Next

COMPUTER SCIENCE AND ENGINEERING

THEORY OF COMPUTATION

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
(A, 1) = B, (A, 0) =A (B, (0, 1)) =C (C, 0) = A (Initial state =A) String=”011001” is transit at which of the states?
A
A
B
C
C
B
D
Invalid String
Explanation: 

Detailed explanation-1: -The transition function is also called a next state function meaning that the automaton moves into the state (q, a) if it receives the input symbol a while in state q. Thus in the example of vending machine, if q is the initial state and a nickel is put in, then (q, a) is equal to “have received 5 cents".

Detailed explanation-2: -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.

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: -performed over a state in a DFA is 4.

There is 1 question to complete.
Previous
Next