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

529 users

0 votes

Referring to the below questions from Exam Paper 2018.02.14 and Exam Paper 2017.08.29 respectively -

In the first question when we are applying Rabin-Scott-Subset-Construction to liveliness automation, we are adding additional state to make it total whereas in the second question, we are not adding any additional state. Why is that so?

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

1 Answer

0 votes
 
Best answer
The Rabin-Scott subset construction does not work in general for liveness automata. It does however always work correctly for totally defined liveness automata. That is why we first try to make the liveness automaton totally defined (which however cannot always be done since the nondeterministic version of liveness automata is more powerful than the deterministic one).

Number 2 above refers to the result obtained by the subset construction. Sometimes it is possible that the result is a deterministic prefix automaton, and the number 2 wants you to define a prefix acceptance condition for the result.
by (166k points)
selected by

Related questions

0 votes
1 answer
0 votes
2 answers
asked Jan 15, 2021 in * TF "Emb. Sys. and Rob." by MS (1.1k points)
0 votes
1 answer
0 votes
1 answer
asked Jan 18, 2021 in * TF "Emb. Sys. and Rob." by MS (1.1k points)
0 votes
1 answer
asked Jan 13, 2021 in * TF "Emb. Sys. and Rob." by MS (1.1k points)
Imprint | Privacy Policy
...