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

556 users

0 votes
Question 2)c) BDD

How is the propositional formula a ∧ ¬c ∨ c ∧ ¬b obtained for the given ROBDD diagram?

Question 3) Simulation

The state pair (s3, q0), (s3,q2) is written in step s0. I am not sure if it was written accidentally since there is not state s3.
in # Study-Organisation (Master) by (300 points)

1 Answer

0 votes
First question: you have to enumerate the paths from the root node to the 1-leaf as conjuncts for a DNF. There are two paths c&!b and !c&a from the root node c.

Second question: yes, there is something wrong. As far as I can say, states Si should be Qi and Qi should be Si. But that is also mentioned in the solution.
by (170k points)

Related questions

0 votes
1 answer
0 votes
1 answer
asked Aug 22, 2020 in * TF "Intelligent Systems" by Khushnood (640 points)
0 votes
1 answer
asked Jan 4, 2023 in * TF "Intelligent Systems" by Pavithra rani (850 points)
0 votes
1 answer
Imprint | Privacy Policy
...