[CSUSB] >> [CompSci] >> [Dick Botting] >> [CS656/556 Course Materials] >> class/08
[Index] || [Contents] || [Grades] Mon Mar 3 14:43:01 PST 2003
656/556 2003 1w 08 OBBDs 2
Admin:

Assigned work due: Exercise 1c of exercises 6.5 page333,
	Hand in Tree and OBDD

Chapter 6 OBDD. Sections 6.2
   Section 6.2.  Algorithms for handling OBDDs
        reduce
        apply
           Shannon expansion of Boolean functions
        restrict
        exists
   Assessment of OBDDs
       complexity
       extensions and variations

Assigned work:
   Do the exercise on the "apply algorithm" handout:
	Generate x.y+ (-x).(-y) from OBDD for x.y and the OBDD (-x).(-y) and
	check that the result is the OBDD x<->y.

lab:   Search the web for "OBDD".  What do you find?
    Helpful description of the apply algorithm
	http://www.cs.engr.uky.edu/~lewis/papers/merge-alg.pdf
    Java2 version of the apply algorithm:
	http://www.bdd-portal.org/visBDD/


        
   
next: Chapter2, section 2.1, 2.2, 2.3 LPC
http://www.csci.csusb.edu/dick/cs656/class/09.html