𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A system of equivalent transformations of expressions

✍ Scribed by V.V. Tumasonis

Publisher
Elsevier Science
Year
1971
Weight
682 KB
Volume
11
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Possibilities of logically equivalent ex
Possibilities of logically equivalent expressions
✍ Harvey J. Greenberg πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 97 KB

If A is logically equivalent to B, it is not necessary that #(A) = p(B). This technical note proves, however, that if A is in CNF, there exists some logically equivalent DNF, B, such that p(A) = #(B). Β© 1997 Elsevier Science B.V. Let #(P) denote the possibility of P being true, where 0 ~< p(P) ~< 1.

Twist–Rotation Transformations of Binary
Twist–Rotation Transformations of Binary Trees and Arithmetic Expressions
✍ Ming Li; Louxin Zhang πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 101 KB

The paper studies the computational complexity and efficient algorithms for the twist᎐rotation transformations of binary trees, which is equivalent to the transformation of arithmetic expressions over an associative and commutative binary Ž . operation. The main results are 1 a full binary tree with