Publicado en 3C Tecnología – Volume 11 Issue 2 (Ed. 42)
Autores
Resumen
Abstract
In this paper, we provide a characterization for the subshifts of finite type (SFT) in terms of Cellular
automata (CA). In addition, we prove that
1. The following are equivalent for a non-singleton subshift of finite type XF.
a) XF is transitive and Per(XF), the set of periodic points of XF, is cofinite
b) XF is weak mixing
c) XF is mixing.
2. For non-singleton sofic shifts, only the statements (a) and (b) are equivalent.
Artículo
Palabras clave
Keywords
subshift of finite type, sofic shifts, mixing, strongly connected digraph, labeled digraph, cellular automataArticulos relacionados
- Study of Different Coding Methods of Polar code in 5G Communication system
- Arduino Based Insect & Rodent Repeller for Living & Working Spaces
- Implementation of Hand Gesture-Controlled Mouse Using Artificial Intelligence
- Implementation of Ensemble Method on DNA Data Using Various Cross Validation Techniques
- Deep Learning based missing object Detection and Person Identification: An application for Smart CCTV
- Verification of Role of Data Scanning Direction in Image Compression using Fuzzy Composition Operations
- Limit cycles of perturbed global isochronous center