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


546 users

sheet 12 2c [closed]

0 votes

It is not clear to me what is being asked here.

Compute the set of states from which the states satisfy !(a&b) can be reached symbolically, and submit the solution in disjunctive normal form.

My interpretation: We need to find a set of states that satisfy !(a&b) and are reachable... Which refers to the universal predecessors of !(a&b)?

closed with the note: Answer found
in * TF "Emb. Sys. and Rob." by (610 points)
closed by

1 Answer

0 votes

My interpretation: Compute the set of states that can be reached from the states satisfying !(a&b) in a symbolic manner, and submit the solution in disjunctive normal form.

by (166k points)
Imprint | Privacy Policy