Table of contents (PDF)

Foreword (PDF)

Threshold gate network synthesis (Abstract)

On maximum stability realizations of linearly separable Boolean functions (Abstract)

Synthesis of counters with threshold elements (Abstract)

Minimal linear decompositions of switching functions (Abstract)

Two-level threshold minimization (Abstract)

Cascade synthesis of finite-state machines (Abstract)

Decomposition of sequential machines (Abstract)

Modular synthesis of sequential machines (Abstract)

On shift register realizations for sequential machines (Abstract)

On single-loop realizations of automata (Abstract)

Feedback in asynchronous sequential circuits (Abstract)

The synthesis of TANT networks (Abstract)

Procedures for minimization of "Exclusive-or" and "Logical-equivalence" switching circuits (Abstract)

A theory of high-speed clocked logic (Abstract)

A proof concerning infinite nets of logic elements without feedback (Abstract)

Crossing sequences and off-line turing machine computations (Abstract)

Translational methods and computational complexity (Abstract)

Hierarchies of memory limited computations (Abstract)

Memory bounds for recognition of context-free and context-sensitive languages (Abstract)

Deterministic context free languages (Abstract)

On multi-head finite automata (Abstract)

Partially ordered classes of finite automata (Abstract)

Transparent categories and categories of transition systems (Abstract)

Reversibility in monadic algebras and automata (Abstract)

On connecting modules together uniformly to form a modular computer (Abstract)

State-calculable stochastic sequential machines, equivalences, and events (Abstract)

Investigation and simulation of a self-repairing digital computer (Abstract)

The controls automation system (Abstract)

An integrated approach to automated computer maintenance (Abstract)

Synthesis of switching circuits to yield prescribed probability relations (Abstract)

Holiac (Abstract)