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

531 users

0 votes

my answer 

labels 0:s0,s2; 1:s1,s2; 2:s1,s3; 3:s0,s1,s3; 4:s0,s1,s2,s3; 5:s4; 6:;

unsafe 6;

init 0;

transitions (0,{a},,5); (0,{},,1); (1,{a},,5); (1,{},,2); (2,{a},,5);(2,{},,3);(3,{a},,5);(3,{},,4);(4,{a},,5);(4,{},,4);(5,{a},,6);(5,{},,6);(6,{a},,6);(6,{},,6);

accept 1,2,3,4;

is wrong can some one explain?

in * TF "Vis. and Sci. Comp." by (300 points)

1 Answer

+1 vote

Where does your state s4 come from? There is no such state in the original automaton. Instead of 5:s4 you should already have 5:; and you do not need a state s6 then. State 5 is then your unsafe state that is a sink state. Check your computation, you made somewhere a mistake where you introduced a state s4 that comes from nowhere. The rest looks good.

Using the following given automaton (initial states and accepting states were highlighted):

the corresponding deterministic automaton computed by Rabin-Scott is as follows (your state numbering is different, but you can find your states here clearly):

by (166k points)
edited by
thanks I understand it now

Related questions

0 votes
1 answer
asked Jun 22, 2020 in * TF "Emb. Sys. and Rob." by MS (1.1k points)
0 votes
1 answer
asked Jun 18, 2020 in * TF "Emb. Sys. and Rob." by MS (1.1k points)
0 votes
1 answer
asked Jun 13, 2020 in * TF "Vis. and Sci. Comp." by nafisur (300 points)
0 votes
1 answer
0 votes
1 answer
Imprint | Privacy Policy
...