VRS Sheet 7 Question 3

Question

Here I have added a sink state first for all the missing inputs and made it to total automaton. Now ignorer to construct Robit Scott subsets, I tried it. But it seems very lengthy and therefore I think it cannot be the answer. Is there a way to minimise it?

Answer 1

The transition from s2 to s3 with input {} should be the other way around.

Comments

okay, thanks for notifying. Now how can I construct Robitt Scott subsets? I mean is there a way to minimise it? If I do it for this diagram it seems quite long. I read somewhere about bad characters but did not figure it out.

---

I don't see a way to minimize, since the resulting automaton is precisely determined. The only thing is that you should start with the initial states, and only continue with reachable states to avoid working on unreachable states. Apart from that, there is no choice in the algorithm.

---

Okay I will try, thanks.

---

Thank you, I did it and the system accepted my answer.