Extension of the system of equivalent transformations of expressions
β Scribed by V.V. Tumasonis
- Publisher
- Elsevier Science
- Year
- 1972
- Weight
- 298 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0041-5553
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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.
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