Here you can ask questions and find or give answers to organizational, academic and other questions about studying computer science.

1.1k questions

1.2k answers

1.6k comments

538 users

0 votes

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?

in * TF "Emb. Sys. and Rob." by (380 points)

1 Answer

0 votes
The transition from s2 to s3 with input {} should be the other way around.
by (166k points)
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.

Related questions

0 votes
1 answer
asked Jun 12, 2023 in * TF "Emb. Sys. and Rob." by farwinr (380 points)
0 votes
1 answer
0 votes
2 answers
asked Jun 13, 2023 in * TF "Emb. Sys. and Rob." by farwinr (380 points)
0 votes
1 answer
Imprint | Privacy Policy
...