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

538 users

0 votes

2018.02.14

This questions asks that at the end we are supposed to convert our result into a quantifier free CNF/DNF. I did not understand what that means, especially the last 2 steps

=>a & !(p | (p & q))=>a&!p

How is "q" removed at the end? 

closed with the note: I understood the final step.
in * TF "Emb. Sys. and Rob." by (1k points)
closed by

1 Answer

0 votes
I understood the final step simplification now. I will close this question.
by (1k points)

Related questions

0 votes
1 answer
0 votes
1 answer
0 votes
1 answer
Imprint | Privacy Policy
...