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
A complete procedure of minimizing input logic in designing
both completely and incompletely specified synchronous, finite state
sequential networks is presented in detail. This procedure consists
of three important steps: 1) state simplification, 2) state assignment
and 3) input logic realization. Two new ideas are presented
in the procedure of...
The problem considered is that of causing all the machines of an
array to turn on simultaneously in the least amount of time. Each
machine is a finite sequential machine that can communicate with a
limited number of prescribed neighbor machines.
A solution for a linear array of these machines,...
The design of checking experiments for sequential machines
which do not initially have a distinguishing sequence is investigated.
Improvem,Jnts are suggested to an existing method for
augmenting the output logic so that the machine acquires homogeneous
distinguishing sequences. To indicate how the procedure
may be implemented on a computer, elements...
Sequential machines uniquely determine directed graphs. A path in a sequential machine may be specified by a starting state and an input sequence. A uniform Hamiltonian touring sequence (UHTS) is an input sequence that specifies a Hamiltonian path regardless of the starting state. We present a polynomial time algorithm that...
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
Utilizing the truth table of a...
Machine learning encompasses probabilistic and statistical techniques that can build models from large quantities of extensional information (examples) with minimal dependence on intensional information (domain knowledge). This focus of machine learning is reflected in the never-ending quest for "off-the-shelf" classifiers. To generalize to unseen data, however, we must make use...