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

I have read the posts on this type of problem but the answer I am submitting is not accepted. Can someone please tell me what is my mistake?

Please confirm that: The process to solve this problem is take 1 path of robdd and write the dnf form. then convert dnf form to rmnf.

Is it also possible to solve this problem by - take 1's path of robdd diagram--->write in DNF---->then compute positive davio decomposition ----> then get RMNF.

Are both process correct?

in * TF "Vis. and Sci. Comp." by (870 points)

1 Answer

+1 vote
Get the DNF:

    c&!b | c&b&a | !c&b&a

Make it a full DNF

    c&!b&!a | c&!b&a | c&b&a | !c&b&a

Replace or by xor:

    c&!b&!a ⊕ c&!b&a ⊕ c&b&a ⊕ !c&b&a

Replace negations and multiply out

    c&(b⊕1)&(a⊕1) ⊕ c&(b⊕1)&a ⊕ c&b&a ⊕ (c⊕1)&b&a
    = c&b&(a⊕1) ⊕ c&(a⊕1) ⊕ c&(b⊕1)&a ⊕ c&b&a ⊕ (c⊕1)&b&a
    = c&b&a ⊕ c&b ⊕ c&a ⊕ c ⊕ c&b&a ⊕ c&a ⊕ c&b&a ⊕ c&b&a ⊕ b&a
    = (c&b&a ⊕ c&b&a) ⊕ c&b ⊕ (c&a ⊕ c&a) ⊕ c ⊕ (c&b&a ⊕ c&b&a) ⊕ b&a
    = c&b ⊕ c ⊕ b&a
by (170k points)
I got my mistake. Thank you.

Related questions

0 votes
1 answer
asked Aug 13, 2022 in # Study-Organisation (Master) by yk (2.7k points)
0 votes
1 answer
asked Jul 22, 2022 in * TF "Emb. Sys. and Rob." by CS_E (2.9k points)
0 votes
1 answer
asked Aug 5, 2020 in * TF "Emb. Sys. and Rob." by ssripa (550 points)
Imprint | Privacy Policy
...