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

Given boolean variables p0p1p2, and p3, each pair of the form (pi,pi+1(∈ {012}) is called an adjacent pair. Construct a propositional logic formula φ that holds if and only if no adjacent pair consists of two variables that are evaluated to true.

can (p0 ⊕ p1) & (p1 ⊕ p2)  & (p2 ⊕ p3) be an alternate solution for above question?

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

1 Answer

+1 vote
 
Best answer
I think that this is not right, since your formulation demands that one of the two adjacent variables has to be true while the problem statement allows that both may be false.
by (166k points)
selected by
Imprint | Privacy Policy
...