Question 9378 – Operating-Systems
November 9, 2023GATE 2020
November 9, 2023Theory-of-Computation
|
Question 23
|
Consider the following language.
L = {x ∈ {a,b}* | number of a’s in x is divisible by 2 but not divisible by 3}
The minimum number of states in a DFA that accepts L is ______.
|
6
|
Question 23 Explanation:
DFA 1: No. of a’s divisible by 2.
DFA 1: No. of a’s not divisible by 3
Using product automata:
DFA 1: No. of a’s not divisible by 3
Using product automata:
Correct Answer: A
Question 23 Explanation:
DFA 1: No. of a’s divisible by 2.
DFA 1: No. of a’s not divisible by 3
Using product automata:
DFA 1: No. of a’s not divisible by 3
Using product automata: