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ženo v:

Podrobná bibliografie
Vydáno v:	IEEE Trans. Comput Ročník 42; číslo 5; s. 568 - 576
Hlavní autoři:	Brand, D., Sasao, T.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.05.1993 Institute of Electrical and Electronics Engineers (IEEE) Institute of Electrical and Electronics Engineers
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!