0 votes 0 votes For Σ = {a, b}, construct dfa’s that accept the sets consisting of: (d) all strings with at least one b and exactly two a’s. (e) all the strings with exactly two a’s and more than three b’s. Theory of Computation theory-of-computation peter-linz finite-automata + – Silver_Reaper asked Jan 24, 2023 Silver_Reaper 392 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.