- Full text PDF available (0)
- This year (0)
- Last 5 years (0)
- Last 10 years (0)
Journals and Conferences
In this paper the construction of a switching network capable of <italic>n</italic>!-permutation of its <italic>n</italic> input terminals to its <italic>n</italic> output terminals is described. The… (More)
A 16 state machine is proposed as an optimum solution to the "Firing Squad Synchronization Problem." It is shown that when given an arbitrarily long (but finite) array of such machines and a command… (More)
Programs (Program Schemas) Flowchart Schemas and Interpretations Free Interpretations
Abstract—A class of networks is described that has the capability of permuting in an arbitrary manner a set of n digital input lines onto a set of n digital output lines. The circuitry of the… (More)
This correspondence demonstrates an improvement on Winogard's algorithm for inner products as applied to the multiplication of two matrices.
The consecutive retrieval (CR) property has been defined as the property of a query that can be answered by the retrieval of consecutive records in a file. In this correspondence we add some… (More)
Theorem 1 and Corollaries t and 2 (pp. 159, 160) are correct, as egm be verified from the given constructive proof (p. HiD. However, the proof given for Theorem 1 is in error, since it does not run… (More)
A one-dimensional array of finite-state machines is being considered as a model for sequence replication. The authors consider the initial state of the first k machines in the array as representing… (More)
This work is a solution to the generalization of the by now classical problem of Minsky, namely, the firing squad problem.
This note describes an approach take n for four consecutive semesters i n teaching an introductory programmin g course. The CIS — 21 course at Templ e University is being taught at the Schoo l of… (More)