Help on NAND gates

Article View: aus.computers.logic-prog

Article #460

Back to aus.computers.logic-prog Previous Next

#460

From: felixmeister
Date: Tue, 06 May 1997 00:00

10 lines
1092 bytes

Can anyone please help with a problem.

How can you show that any minimal AND/OR circuit can be replaced by an
equivalent circuit that uses the same number of NAND gates as in the
AND/OR circuit and no logic gates of any other kind.

regards

Andrew Poli

Technical Details

Message-ID: <336EE1FC.76A5@icenet.com.au>

Path: arc1-ca.pugleaf.net!unknown!not-for-mail

Show Full Headers

Complete Article Headers

X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: fd9bd,83f2e73c9bdcc7dd,start
X-Google-Attributes: gidfd9bd,public
X-Google-Thread: 115730,83f2e73c9bdcc7dd,start
X-Google-Attributes: gid115730,public
X-Google-Thread: 112d1e,83f2e73c9bdcc7dd,start
X-Google-Attributes: gid112d1e,public
X-Google-Thread: 107cee,83f2e73c9bdcc7dd,start
X-Google-Attributes: gid107cee,public
X-Google-Thread: 111d0a,83f2e73c9bdcc7dd,start
X-Google-Attributes: gid111d0a,public
From: felixmeister <gaynos@icenet.com.au>
Subject: Help  on NAND gates
Date: 1997/05/06
Message-ID: <336EE1FC.76A5@icenet.com.au>
X-Deja-AN: 239678038
Organization: felixmeister inc
Reply-To: gaynos@icenet.com.au
Newsgroups: aus.computers.logic-prog,sci.electronics.equipment,sci.electronics.misc,sci.electronics.design,sci.electronics.basics