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

912 questions

1k answers

1.4k comments

441 users

0 votes

in # Study-Organisation (Master) by (300 points)

2 Answers

0 votes

When we describe state sets by propositional logic formulas, i.e., a symbolic encoding, then the represented states correspond with the satisfying assignments of the formula. In this case, we will have three initial states as you can see by the truth table:

PQTRUE<->P|Q
000
011
101
111

 

So, initial states are {p}, {q}, and also {p,q}. Having said that, it don't recommend truth tables to find the satisfying assignments. We have better options using e.g. BDDs. 
by (142k points)
+1 vote
First of all I would transform true <->q|p, this is equivalent to q|p.

Now, every state satifying q|p is an initial state. The states satisfying q|p are {p}, {q}, {p,q}.

The variables not used in the sets are negated, this means {p} is equal to p&!q
by (1.7k points)
Imprint | Privacy Policy
...