Survey of research in the theory of homogeneous structures and their applications

DOI10.1016/0025-5564(74)90088-1zbMath0297.68005OpenAlexW2057380450MaRDI QIDQ1214256

Victor Aladyev

Publication date: 1974

Published in: Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0025-5564(74)90088-1

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General biology and biomathematics (92B05) Research exposition (monographs, survey articles) pertaining to biology (92-02)

Related Items (8)

Microeconomic foundations of cyclical irregularities or chaos ⋮ Growth patterns of ordered cellular automata ⋮ Unnamed Item ⋮ Approximations of cooperative equilibria in multi-person prisoners' dilemma played by cellular automata ⋮ The behavioral properties of homogeneous structures ⋮ (A-)synchronous (non)-deterministic cell spaces simulating each other ⋮ Statistical mechanics of cellular automata ⋮ Theoretical reconciliation of equilibrium and structural approaches

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The constructibility of a configuration in a cellular automaton
• A completeness problem for pattern generation in tessellation automata
• A graph-theoretical model for periodic discrete structures
• Tessellation structures for reproduction of arbitrary patterns
• Some regular state sets in the system of one-dimensional iterative automata
• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
• Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
• Simple self-reproducing universal automata
• An Iteratively Structured General-Purpose Digital Computer
• Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
• Generation of Primes by a One-Dimensional Real-Time Iterative Array
• A Model of Replication
• Representation of Events in the von Neumann Cellular Model
• The Garden-of-Eden Theorem for Finite Configurations
• Machine Complexity Versus Interconnection Complexity in Iterative Arrays
• Cellular automata complexity trade-offs
• Structural and behavioral equivalences of tessellation automata
• Numerical testing of evolution theories^†
• Some comments on neighborhood size for tessellation automata
• One-Pass Complexity of Digital Picture Properties

This page was built for publication: Survey of research in the theory of homogeneous structures and their applications