1.1). The alphabet is {a, b}. Give the state diagram of the DFA recognizing the language: {w | w has an odd number of a’s and at least two b's}. Show the steps!
1.2). Give the state diagram of the DFA which recognizes the complement of the above language in 1.1.
Use 1.1 to answer 1.2
**I ONLY NEED HELP WITH 1.2* PLEASE*
Hi,
I have attached both answers due to dependency and for better understanding.
Hope it helps.
Still if you have any doubt or need help, please let me know in comment section and if you like, Please upvote.
Thank You !
Get Answers For Free
Most questions answered within 1 hours.