Question 15971 – STQC-NIELIT STA 2021
November 19, 2023Question 5023 – Graph-Theory
November 19, 2023Question 9768 – Theory-of-Computation
Consider a DFA over Σ = {a,b} accepting all strings which have number of a’s divisible by 6 and number of b’s divisible by 8. What is the minimum number of states that the DFA will have?
Correct Answer: D
Question 50 Explanation:
A DFA which is no. of a’s divisible by 6 consists of 6 states i.e., mod6 results 0,1,2,3,4,5.
Same as b’s divisible by 8 contains 8 state.
Total no. of states is = 8 * 6 = 48
Same as b’s divisible by 8 contains 8 state.
Total no. of states is = 8 * 6 = 48
8
14
15
48
Subscribe
Login
0 Comments