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

1.1k questions

1.3k answers

1.7k comments

557 users

0 votes
so on state Q I find out the relation is (p’ exor q’) & (!q’ | !p’) .. so from the exor we can determine that the transition should be on {!p&q} and {p&!q} state. But what about (!q’ | !p’) ??. It can be simplified into !(q’&p’). And we get the transition to {!p&q} and {p&!q} and {} state.

But while checking the answer there is no transition from state q to empty set.
related to an answer for: Transition relations to kripke diagram
in # Study-Organisation (Master) by (190 points)
edited by

1 Answer

0 votes
Sure, just note that !q'|!p' is equivalent to p'&!q' | !p'&q' | !p'&!q', since if q' is false p' may be true or false, and if q' is true, then p' must be false.
by (170k points)

Related questions

Imprint | Privacy Policy
...