The total number of states to build the given language using DFA: L = {w | w has exactly 2 a’s and at least 2 b’s}
Posted: Thu Jul 14, 2022 9:24 am
a) 10
b) 11
c) 12
d) 13
b) 11
c) 12
d) 13
Accurate answers. Every time.
https://answerhappy.com/