Secure multi-party computation (MPC) is a conceptual framework in cryptography. It allows distrusting parties engage in a protocol to perform a computational task while still maintain some secure properties. Most existing approaches are required to interpret functions as a boolean circuit. With the recent state-of-art circuit garbling scheme, the performance...
The emergence of the three-input majority gate as a practical element for logical design has demanded a useful method of design using these elements. In order to facilitate the use of this gate, a digital computer program is presented to implement the design procedure. Utilizing the truth table of a...
In this thesis we introduce alpha and beta tree acceptors,
generalizations of tree automata. The alpha tree acceptors recognize
a tree by final symbol and the beta tree acceptors by final state. We
show that alpha and beta tree acceptors recognize the same sets of
Gorn trees and demonstrate that...
The use of Regular Expressions to represent the conditions of operations of a finite automaton is becoming popular. A finite automaton can be represented by several regular expressions which are entirely different in out-looks and in structures. It is the primary purpose of this paper to develop several approaches to...
The project herein described, presents the results of an investigation
in the relatively new and expanding field of computer stimulated
learning machines for use in pattern recognition.
A learning machine, one that benefits from its past experience
was devised in computer program form. It may be described as a
Piecewise-Linear,...