Q3. Design a DFA that accepting the following language, where Σ = {a, b} : a. L = { | has odd number of a's and ends with a b}, (€ included).
Informatique
hnanfaisal20
Question
Q3. Design a DFA that accepting the following language,
where Σ = {a, b} :
a. L = { | has odd number of a's and ends with a b}, (€
included).
where Σ = {a, b} :
a. L = { | has odd number of a's and ends with a b}, (€
included).
