Related papers: Finite state automata and homeomorphism of self-si…
Finite automata were used to determine multiple addresses in number systems and to find topological properties of self-affine tiles and finite type fractals. We join these two lines of research by axiomatically defining automata which…
In this paper, we use a class of finite state automata, called topology automaton, to study the metric classification of a special class of post-critically finite self-similar sets. As an application, we prove that the conformal dimension…
The study of Lipschitz equivalence of fractals is a very active topic in recent years. Most of the studies in literature concern totally disconnected fractals. In this paper, using finite state automata, we construct a bi-Lipschitz map…
The study of Lipschitz equivalence of fractals is a very active topic in recent years. In 2023, Huang \emph{et al.} (\textit{Topology automaton of self-similar sets and its applications to metrical classifications}, Nonlinearity \textbf{36}…
Lipschitz equivalence of self-similar sets is an important area in the study of fractal geometry. It is known that two dust-like self-similar sets with the same contraction ratios are always Lipschitz equivalent. However, when self-similar…
In this paper we provide an up-to-date survey on the study of Lipschitz equivalence of self-similar sets. Lipschitz equivalence is an important property in fractal geometry because it preserves many key properties of fractal sets. A…
The concept of self-similarity on subsets of algebraic varieties is defined by considering algebraic endomorphisms of the variety as `similarity' maps. Self-similar fractals are subsets of algebraic varieties which can be written as a…
We introduce a new category of higher-dimensional automata in which the morphisms are functional homotopy simulations, i.e. functional simulations up to concurrency of independent events. For this, we use unfoldings of higher-dimensional…
We study the synchronous and asynchronous automatic structures on the fundamental group of a graph of groups in which each edge group is finite. Up to a natural equivalence relation, the set of biautomatic structures on such a graph product…
Two new classes of finite automata, called General hexagonal Boustrophedon finite automata and General hexagonal returning finite automata operating on hexagonal grids, are introduced and analyzed. The work establishes the theoretical…
The transition structure of an automaton can be used to create a natural topology to the set of states of an automaton, generating, this way, a topological space. Probabilistic automata can also be modeled in terms of measure theory. A…
We demonstrate existence of a tile assembly system that self-assembles the statistically self-similar Sierpinski Triangle in the Winfree-Rothemund Tile Assembly Model. This appears to be the first paper that considers self-assembly of a…
We introduce the notion of (abelian) similarity scheme, as a constructive model for topological self-similar fractals, in the same way in which the notion of iterated function system furnishes a constructive notion of self-similar fractals…
This paper seeks to build on the extensive connections that have arisen between automata theory, combinatorics on words, fractal geometry, and model theory. Results in this paper establish a characterization for the behavior of the fractal…
Analysis on fractals is a growing field, with hints of potential for widespread applicability across all of STEM. One of the most heavily researched type of fractals are the nested fractals, fractal shapes defined by virtue of being made of…
We consider two relatively natural topologizations of the set of all cellular automata on a fixed alphabet. The first turns out to be rather pathological, in that the countable space becomes neither first-countable nor sequential. Also,…
We show that certain representations of graphs by operators on Hilbert space have uses in signal processing and in symbolic dynamics. Our main result is that graphs built on automata have fractal characteristics. We make this precise with…
We develop a local theory for the construction of singular spacetimes in all spacetime dimensions which become asymptotically self-similar as the singularity is approached. The techniques developed also allow us to construct and classify…
We establish the equivalence between a class of asynchronous distributed automata and a small fragment of least fixpoint logic, when restricted to finite directed graphs. More specifically, the logic we consider is (a variant of) the…
Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups…