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

928 questions

1k answers

1.4k comments

441 users

0 votes

Given 

________________________________________________________________

  • Is the following solution verbatim accepted as solution in the exam? 
  • If not, what else needs to be added? 
  • Do you have any tips to save time while solving Zielonka?

Game 0

 

________________________________________________________________________________

h = 6 , Qh  = {s4}  i=0 

A := attr0{s4} := {s1,s4}

G\A : game 1

From game 1: win'0,win'1={{s0,s2,s3},{}}

win'1={} 

So, the solution of game 0:

{win0,win1}={{s0,s1,s2,s3,s4},{}}

Game 1

________________________________________________________________________________________________________________________________

h = 4 , Qh  = {s2}  i=0 

A := attr0{s2} := {s0,s2,s3}

G\A : Trivial

win'1={} 

So, the solution of game 1:

{win0,win1}={{s0,s2,s3},{}}

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

1 Answer

+1 vote
 
Best answer
Well to explain how the Zielonka algorithm works to solve an example, yes, I think you need to describe the above steps more or less with the same details. However, the example may be one that requires less recursive calls than this example that is quite challenging and has been chosen to see the algorithm at work. You may expect fewer recursive calls in the exam.
by (143k points)
selected by
Thank you, Professor! so, there is no need to write the attractor formula and show how we got these states?
Hmm, I hesitate to say yes here, since the exam problems are not yet made. Maybe there will be an problem part that will exactly ask for this. But if not, I would say that the print out of the teaching tool should be sufficient.
Ok, yes I understand. Thank you!
Imprint | Privacy Policy
...