Minimization of AND-EXOR expressions using rewrite rules

Conditions for generating optimal two-level AND-EXOR representations using rewrite rules are considered. Four results are presented. First, it is shown that a necessary condition for obtaining minimality is a temporary increase in the size of expressions during minimization. Second, a sufficient con...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE Trans. Comput Vol. 42; no. 5; pp. 568 - 576
Main Authors:	Brand, D., Sasao, T.
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01.05.1993 Institute of Electrical and Electronics Engineers (IEEE) Institute of Electrical and Electronics Engineers
Subjects:	Applied sciences Circuit testing Computer science Computer science; control theory; systems Exact sciences and technology Logic Minimization methods Modules (abstract algebra) Programming theory Sufficient conditions Theoretical computing Red-Muller expansion Nondeterministic algorithm Logic minimization Rewriting Programming Two level representation Rewrite rull Programming theory
ISSN:	0018-9340
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!