TOPICS IN THE THEORY OF ONE-DIMENSIONAL ITERATIVE NETWORKS,

Abstract

Proof is given that many one-dimensional iterative logic systems have cell types that cannot be equivalently decomposed into partially separate left-to-right and right-to-left subcells, almost regardless of the slightness of subcell separation and/or the weakness of system equivalence required. Several new results on the dynamic behavior of iterative networks of Hennie's decomposable type are summarized. (Author)

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1963
Accession Number
AD0425943

Entities

People

  • William L. Kilmer

Tags

Fields of Study

  • Mathematics

Readers

  • Computational Linguistics
  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Mathematical Modeling and Probability Theory.