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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE Trans. Comput Ročník 42; číslo 5; s. 568 - 576
Hlavní autori:	Brand, D., Sasao, T.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York, NY IEEE 01.05.1993 Institute of Electrical and Electronics Engineers (IEEE) Institute of Electrical and Electronics Engineers
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!