automata, a Hybrid System for Computational

2003

A cellular automaton is a decentralized computing model providing an excellent platform for performing complex computation with the help of only local information. Researchers, scientists and practitioners from different fields have exploited the CA paradigm of local information, decentralized control and universal computation for modeling different applications. This article provides a survey of available literature of some of the methodologies employed by researchers to utilize cellular automata for modeling purposes. The survey introduces the different types of cellular automata being used for modeling and the analytical methods used to predict its global behavior from its local configurations. It further gives a detailed sketch of the efforts undertaken to configure the local settings of CA from a given global situation; the problem which has been traditionally termed as the inverse problem. Finally, it presents the different fields in which CA have been applied. The extensive bibliography provided with the article will be of help to the new entrant as well as researchers working in this field.

2018

The topic of cellular automata has many interesting and wide ranging applications to real life problems emerging from areas such as image processing, cryptography, neural networks, developing electronic devices and modelling biological systems. In fact cellular automata can be a powerful tool for modelling many kinds of systems. In the March 2018 issue of At Right Angles we had introduced the basic ideas which form the foundation of the Elementary Cellular Automata (ECA) as defined by Stephen Wolfram. The reader is urged to go through the article before reading this. The topic of Cellular Automata lends itself to interesting investigations which are well within the reach of high school students. We had illustrated the simple and yet powerful ideas in the previous article where we had described and analysed the behaviour of the 256 ECAs. In this article we shall provide a brief recap for the first time reader before moving on to the concept of Totalistic Cellular Automata

2011

There has been a move recently in academia, industry, and the consumer space towards the use of unsupervised parallel computation and distributed networks (i.e., networks of computing elements working together to achieve a global outcome with only local knowledge). To fully understand the types of problems that these systems are applied to regularly, a representative member of this group of unsupervised parallel and distributed systems is needed to allow the development of generalizable results. Although not the only potential candidate, the field of cellular automata is an excellent choice for analyzing how these systems work as it is one of the simplest members of this group in terms of design specification. The current ability of the field of cellular automata to represent the realm of unsupervised parallel and distributed systems is limited to only a subset of the possible systems, which leads to the main goal of this work of finding a method of allowing cellular automata to rep...

Information and Computation, 1999

The work is concerned with the trade-offs between the dimension and the time and space complexity of computations on nondeterministic cellular automata. We assume that the space complexity is the diameter of area in space involved in computation. It is proved, that 1). Every NCA A of dimension r, computing a predicate P with time complexity T (n) and space complexity S(n) can be simulated by r-dimensional NCA with time and space complexity O(T

2019

Universality in cellular automata theory is a central problem studied and developed from their origins by John von Neumann. In this paper, we present an algorithm where any Turing machine can be converted to one-dimensional cellular automaton with a 2-linear time and display its spatial dynamics. Three particular Turing machines are converted in three universal one-dimensional cellular automata, they are: binary sum, rule 110 and a universal reversible Turing machine.

IOS Press eBooks, 2020

Cellular automata are a massively parallel programming model that are capable to solve many algorithmic problems efficiently. The complexity of defining a suitable cell rule for a concrete problem can be overcome by the use of the extended model of global cellular automata in conjunction with specialized compilers, to translate a high-level imperative programming language to cellular automata. Obviously, the execution on universal multicore processors does not make use of the full parallel potential of cellular automata and the workflow for direct hardware implementations is slow and hard to debug. In this paper, we propose a novel processor architecture that can execute a global cellular automaton as software and can still compete with other software or hardware implementations.

Complex Systems, 2016

Commutative cellular automata are a class of cellular automata that portray certain characteristics of commutative behavior. We develop the notion of neighborhood partitions and neighborhood equivalence classes to analyze and enumerate these automata.

2007

Abstract We review, in a unified framework, translations from five different logics—monadic second-order logic of one and two successors (S1S and S2S), linear-time temporal logic (LTL), computation tree logic (CTL), and modal µ-calculus (MC)—into appropriate models of finite-state automata on infinite words or infinite trees. Together with emptiness-testing algorithms for these models of automata, this yields decision procedures for these logics.

Emergence, Complexity and Computation, 2013

We conduct a brief survey on Wolfram's classification, in particular related to the computing capabilities of Cellular Automata (CA) in Wolfram's classes III and IV. We formulate and shed light on the question of whether Class III systems are capable of Turing universality or may turn out to be "too hot" in practice to be controlled and programmed. We show that systems in Class III are indeed capable of computation and that there is no reason to believe that they are unable, in principle, to reach Turing-completness.

2004

In simulating complex phenomena by Cellular Automata (CA) programming model performances assume a crucial role. The efficient exploitation of intrinsic parallelism is a must for this kind of applications. The Cellular Automata Network (CAN) model, that is an extension of the CA classical model due to the introduction of the network abstraction between automata nodes, offer another parallelism source besides to the classical CA parallelism source. In order to exploit efficiently this opportunities tools and systems must be designed. In this paper we deal with the CAN compiler system components description and features designed ad hoc.