Finite state machine that recognizes set (01 U 111)*10*(0 U 1)

[ab3232]

2.5 Draw a finite-state machine that recognizes the set: \(\displaystyle \left(01\, \cup\, 111\right)\, *\, 10\, *\, \left(0\, \cup\, 1\right)\)

So I have this question in an prep exam. The thing I don't understand with this question is what is said. If there is anyone who could simplify the thing they're looking for you'd be really helpful. I need the explanation of what (01 U 111)*10*(0 U 1) means. I know that it means the bit strings that are accepted but I want to understand the notation U what that means and how it changes the finite state machine. It would be really helpful if anyone could just help explain this for me.

Well greetings, Kevin!

 

[ab3232]

Finite state machine



Hello I am kind of stuck with this question regarding a finite state machine. I find it hard to understand what exactly they are looking for. I don't understand what sets they're after because I can't understand the notation U inside of the sets. Could someone be nice and explain what they mean by (01 U 111)*10*(0 U 1) is it that all sets should either begin with 01 or 111 and also have a 10 in the middle and can end with either a 0 or a 1.

Well greetings, Kevin!