I've been given following task: Determine the following nondeterministic automaton (omit unreachable states, if they appear during construction)
My solution to this:
Would like to ask for a verification here, especially for the part of this task which is enclosed in parentheses: omit unreachable states, if they appear during construction. I do not fully understand that requirement and therefore I'm not sure if my solution is correct. Did I present some states which should be omitted on the graph/table? I feel like each state is reachable here and maybe task's description itself would have more sense for different example.