Path Detection in Multidimensional Iterative Arrays

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Path Detection in Multidimensional Iterative Arrays

Full text

Pdf (570 KB)

Source

Journal of the ACM (JACM) archive
Volume 14 , Issue 2 (April 1967) table of contents

Pages: 300 - 310

Year of Publication: 1967

ISSN:0004-5411

Author

William M. Waite

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 14, Citation Count: 3

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/321386.321392 What is a DOI?

ABSTRACT

An iterative array is defined as an infinite set of identical blocks, interconnected in a regular manner. Each block has inputs and outputs, with internal connections from certain inputs to certain outputs. This paper is concerned with the problem of determining, for a given structure internal to each block, the existence of a given path. The path is specified by the relative positions in the array of its endpoints, and the algorithm presented decides whether such a path is possible in the given array. A special case of the general procedure, which tests for a closed path, has been successfully programmed.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	UNGER, S.H. A computer oriented toward spatial problems. Proc. IRE 46, I0 (Oct. 1958) 1744-1750.
	2	LEE, C. Y., AND PAULb, M. C. A content addressable distributed logic memory with applications to information retrieval. Proc. IRE 51, 6 (June 1963), 924-932.
	3	GREGORY, J., AND McREYNOI,DS, R. The SOLOMON computer. IEEE Trans, EC-12, 6 (Dec. 1963), 774-781.
	4	GONZALEZ, R. A multilayer iterative circuit computer. IEEE Trans. EC-12, 6 (Dec. 1963), 781-790.
	5	MCCORMICK, B. The Illinois pattern recognition computer--ILLIAC III. IEEE Trans. EC-12, 6 (Dec. 1963), 791-813.
	6	UNGER, S.H. Pattern recognition using two-dimensional, bilateral, iterative, combinationAL switching circuits. Proc. Polytechnic Inst. of Brooklyn Symp. on Mathematical Theory of Automata, Polytechnic Press, Brooklyn, N. Y., 1963.
	7	HNNIE, F.C. Iteralive Arrays of Logical Circuits. Technology Press of MIT, Cambridge, Mass., and Wiley, New York, 1961.
	8	WAITS, W.M. The production of completion signals by asynchronous, iterative networks. IEEE Trans. EC-18, 2 (April 1964), 83-86.
	9	McNAuoHTOr, R., AND YAMADA, H. Regular expressions and state graphs for automata. IRE Trans. EC-9, 1 (March 1960), 39-47.
	10	BazozowsI, J. A. A survey of regular expressions and their applications. IRE Trans. EC-11, 3 (June 1962), 324-335.

CITED BY 3

	V. P. Roychowdhury , T. Kailath, Study of parallelism in regular iterative algorithms, Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, p.367-376, July 02-06, 1990, Island of Crete, Greece
	William M. Waite, An efficient procedure for the generation of closed subsets, Communications of the ACM, v.10 n.3, p.169-171, March 1967
	Hugo A. DiGiulio , Paul L. Tuan, A system for network picture processing with interactive computer graphics, Proceedings of the 1969 24th national conference, p.587-610, August 26-28, 1969