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)

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)

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 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)