Let $\Sigma = \{0,1\}$
My interpretation of the regular expression = $\Sigma^*01\cup \Sigma^*11\cup \Sigma^*00$
I've created this finite automata with 3 states which I believe fits the criteria. However Im still not sure if I have made this FA correctly. I've checked online resources, watched videos on FA, but I dont have anyone to validate it. Is this a correct representation of the regular expression?
First made a transition table and created a DFA that did accept all strings ending with 10, found its converse, which was the final answer