Give state diagrams of DFAs recognizing the following languages. In all parts, the alphabet is {0,1}. e. {w| w starts with 0 and has odd length, or starts with 1 and has even length}
Can you please help me with me with this regular expression problem. I need help with 1.18 part E but you need 1.16 to answer the question for 1.18 part E. Can you explain it step by step leading up to the regular expression I just need something visual with the regular expression.
I have tried part B but I keep getting it wrong, I attached the incorrect answer and the reason behind the incorrect answer in the photo. I have tried it the way how I did it and with {} but the answer is still wrong. Can you please help get this problem correct this is my only attempt.
I have attached the question below.
Question that I need help with for 1.18
1.18 Give regular expressions generating the languages of Exercise 1.6.
The question for 1.6
1.6 Give state diagrams of DFAs recognizing the following languages. In all parts, the alphabet is {0,1}.
e. {w| w starts with 0 and has odd length, or starts with 1 and has even length}
Step by step
Solved in 5 steps with 1 images
