MCQ IN COMPUTER SCIENCE & ENGINEERING

Previous
Next

COMPUTER SCIENCE AND ENGINEERING

THEORY OF COMPUTATION

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Number of states require to accept string ends with 10.
A
3
B
2
C
1
D
can’t be represented.
Explanation: 

Detailed explanation-1: -Number of states require to accept string ends with 10. d) can’t be represented. Explanation: This is minimal finite automata. 4.

Detailed explanation-2: -Hence, 4 states will be required.

Detailed explanation-3: -L=01, 001, 101, 110001, 1001, ………. The minimum length of the string is 2, the number of states that the DFA consists of for the given language is: 2+1 = 3 states.

Detailed explanation-4: -1 Answer. Number of finfinal state(s) require to accept in minimal finite automata is ZERO.

There is 1 question to complete.
Previous
Next