TESSELLATION AUTOMATA

被引：33

作者：

YAMADA, H

AMOROSO, S

机构：

[1] The Moore School of Electrical Engineering, University of Pennsylvania, Philadelphia

[2] US Army Electronics Command, Fort Monmouth, NJ

来源：

INFORMATION AND CONTROL | 1969年 / 14卷 / 03期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1016/S0019-9958(69)90090-4

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Certain mathematical studies of pattern recognition, evolution theories, and self-reproducing automata motivated the definition of the tessellation automaton which is a mathematical model of an infinite array of uniformly interconnected identical finite-state machines. Each machine is capable of changing state at discrete time steps as a function of the states of other machines in the array and inputs that act as environmental changes to the array. This model can embed all the models used in the studies mentioned above, and may serve as a unifying framework. In this first paper certain basic properties of tessellation automata are developed that are intended to serve as an introduction to the more specific studies to be reported in the sequel. © 1969 Academic Press, Inc.

引用

页码：299 / &

共 18 条

[1]

BARRICELLI NA, 1957, METHODOS, V9, P148

[2]

BARRICELLI NA, 1963, ACTA BIOTHEOR, V16, P69

[3]

COHN H, 1962, SECOND COURSE NUMBER

[4]

HARRISON MA, 1965, INTRODUCTION SWITCHI

[5] A CONTENT ADDRESSABLE DISTRIBUTED LOGIC MEMORY WITH APPLICATIONS TO INFORMATION RETRIEVAL [J].

LEE, CY ;

PAULL, MC .

PROCEEDINGS OF THE IEEE, 1963, 51 (06) :924-&

[6]

LEE CY, 1963, MM633445 BELL LAB ME

[7]

LEE CY, 1962, FAL AFIPS P JOINT CO, V22, P130

[8] A SURVEY OF MICROCELLULAR RESEARCH [J].

MINNICK, RC .

JOURNAL OF THE ACM, 1967, 14 (02) :203-+

[9]

Moore E.F., 1962, P S APPL MATH, P17, DOI DOI 10.1090/PSAPM/014/9961

[10]

Myhill J., 1963, P AM MATH SOC, V14, P685, DOI DOI 10.2307/2034301.

← 1 2 →