Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
On pointwise periodicity in tilings, cellular automata, and subshifts
View through CrossRef
We study implications of expansiveness and pointwise periodicity for certain groups and semigroups of transformations. Among other things we prove that every pointwise periodic finitely generated group of cellular automata is necessarily finite. We also prove that a subshift over any finitely generated group that consists of finite orbits is finite, and related results for tilings of Euclidean space.
European Mathematical Society - EMS - Publishing House GmbH
Title: On pointwise periodicity in tilings, cellular automata, and subshifts
Description:
We study implications of expansiveness and pointwise periodicity for certain groups and semigroups of transformations.
Among other things we prove that every pointwise periodic finitely generated group of cellular automata is necessarily finite.
We also prove that a subshift over any finitely generated group that consists of finite orbits is finite, and related results for tilings of Euclidean space.
Related Results
An embedding theorem for multidimensional subshifts
An embedding theorem for multidimensional subshifts
AbstractKrieger’s embedding theorem provides necessary and sufficient conditions for an arbitrary subshift to embed in a given topologically mixing
$\mathbb {Z}$
-subshift of fini...
Simulations for Event-Clock Automata
Simulations for Event-Clock Automata
Event-clock automata (ECA) are a well-known semantic subclass of timed
automata (TA) which enjoy admirable theoretical properties, e.g.,
determinizability, and are practically usef...
A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation
A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation
AbstractIn this paper, we consider a model of generalized timed automata (GTA) with two kinds of clocks, history and future, that can express many timed features succinctly, includ...
Permutation Groups in Automata Diagrams
Permutation Groups in Automata Diagrams
Automata act as classical models for recognition devices. From the previous researches, the classical models of automata have been used to scan strings and to determine the types o...
FUZZY‐FUZZY AUTOMATA
FUZZY‐FUZZY AUTOMATA
Based on the concept of fuzzy sets of type 2 (or fuzzy‐fuzzy sets) defined by L. A. Zadeh, fuzzy‐fuzzy automata ate newly formulated and some properties of these automata are inves...
Minimisation and Language Inclusion for Separating B\"uchi and Parity Automata
Minimisation and Language Inclusion for Separating B\"uchi and Parity Automata
We provide simple proofs of the NC results for the universality, language inclusion, and equivalence problems of unambiguous finite automata, based on recent advances in model chec...
SLk-Tilings and Paths in ℤk
SLk-Tilings and Paths in ℤk
Abstract
An $SL_{k}$-tiling is a bi-infinite array of integers having all adjacent $k\times k$ minors equal to one and all adjacent $(k+1)\times (k+1)$ minors equ...
PERBAIKAN CITRA INFRA MERAH DENGAN METODE CELLULAR AUTOMATA
PERBAIKAN CITRA INFRA MERAH DENGAN METODE CELLULAR AUTOMATA
Image enhancement is needed because not all images have good quality, such as noise, too low contrast or blurry image. These problems are commonly found in images generated from in...