home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.lisp
- Path: sparky!uunet!usc!rpi!batcomputer!cornell!uw-beaver!skate.cs.washington.edu!nick
- From: nick@skate.cs.washington.edu (Nicholas Kushmerick)
- Subject: ?? boolean minimization code ??
- Message-ID: <1992Aug25.204217.2870@beaver.cs.washington.edu>
- Keywords: boolean function minimization
- Sender: news@beaver.cs.washington.edu (USENET News System)
- Organization: University of Washington Computer Science
- Date: Tue, 25 Aug 92 20:42:17 GMT
- Lines: 17
-
- does anybody have any (lisp?!) code that does boolean function minimization,
- e.g.:
-
- p+~p --> true
-
- (a&b)+~a --> b+~a
-
- (~a&~b&c)+(~a&b&c)+(a&~b&c)+(a&b&c) --> c
-
- ideally, both the input and output should be in s-o-p form, like my examples.
-
- thanks!
-
- -- Nick
-
-
-
-