Mathematical Equivalence in a Primitive Ella
Abstract:
The mathematical language L is defined, which represents circuits in a primitive subset of Ella containing delays, pairing, CASE multiplexer expressions, and recursive or feedback expressions. It is shown how by reduction of expressions in this language to an approximated finite form, equivalence between expressions can be tested in finite time. Great Britain.
Security Markings
DOCUMENT & CONTEXTUAL SUMMARY
Distribution:
Approved For Public Release
Distribution Statement:
Approved For Public Release; Distribution Is Unlimited.
RECORD
Collection: TR