Related papers: Fixed Point Constructions in Tilings and Cellular …
We study automatic sequences and automatic systems generated by general constant length (nonprimitive) substitutions. While an automatic system is typically uncountable, the set of automatic sequences is countable, implying that most…
Logic programming with fixed-point definitions is a useful extension of traditional logic programming. Fixed-point definitions can capture simple model checking problems and closed-world assumptions. Its operational semantics is typically…
In this work we show that given a nonlinear programming problem, it is possible to construct a family of dynamical systems defined on the feasible set of the given problem, so that: (a) the equilibrium points are the unknown critical points…
Fixed-Point-Oriented Programming (FPOP) is an emerging paradigm designed to streamline the implementation of problems involving self-referential computations. These include graph algorithms, static analysis, parsing, and distributed…
Several recent papers in digital topology have sought to obtain fixed point results by mimicking the use of tools from classical topology, such as complete metric spaces and homotopy invariant fixed point theory. We show that in many cases,…
Probabilistic Cellular Automata are a generalization of Cellular Automata. Despite their simple definition, they exhibit fascinating and complex behaviours. The stationary behaviour of these models changes when model parameters are varied,…
An automata network (AN) is a finite graph where each node holds a state from a finite alphabet and is equipped with a local map defining the evolution of the state of the node depending on its neighbors. They are studied both from the…
We establish linear convergence rates for a certain class of extrapolated fixed point algorithms which are based on dynamic string-averaging methods in a real Hilbert space. This applies, in particular, to the extrapolated simultaneous and…
Pattern matching design verification has gained noticeable attention in semiconductor technologies as it can precisely identify more localized problematic areas (weakpoints) in the layout. To address these weakpoints, engineers adopt…
We cast new light on the existing models of one-way deterministic topological automata by introducing a fresh but general, convenient model, in which, as each input symbol is read, an interior system of an automaton, known as a…
This paper presents a classification of Cellular Automata rules based on its properties at the nth iteration. Elaborate computer program has been designed to get the nth iteration for arbitrary 1-D or 2-D CA rules. Studies indicate that the…
The stabilization of nonlinear systems under zero-state-detectability assumption or its analogues is considered. The proposed supervisory control provides a finite time practical stabilization of output and it is based on uniting local and…
Cellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper,…
This paper describes a method for converting formulas in finite propositional linear-time temporal logic (Finite LTL) into finite-state automata whose languages are the models of the given formula. Finite LTL differs from traditional LTL in…
This paper presents an application of the Infinite Unit Axiom, introduced by Yaroslav Sergeyev, (see [11] - [14]) to the development of one-dimensional cellular automata. This application allows the establishment of a new and more precise…
In this paper, we study the structure of the set of tilings produced by any given tile-set. For better understanding this structure, we address the set of finite patterns that each tiling contains. This set of patterns can be analyzed in…
It is known that the gradient method can be viewed as a dynamic system where various iterative schemes can be designed as a part of the closed loop system with desirable properties. In this paper, the finite-time and fixed-time convergence…
In this note, we discuss some fixed point theorems for contractive self mappings defined on a $G$-metric spaces. More precisely, we give fised point theorems for mappings with a contractive iterate at a point.
Tile displacement is a newly-recognized mechanism in DNA nanotechnology that exploits principles analogous to toehold-mediated strand displacement but within the context of self-assembled DNA origami tile arrays. Here, we formulate an…
Number-conserving cellular automata (NCCA) are particularly interesting, both because of their natural appearance as models of real systems, and because of the strong restrictions that number-conservation implies. Here we extend the…