Dariusz Jabłoński, Marcin Kulczycki
Abstract
We give a computable condition for topological transitivity and topological mixing of subshifts of finite type. An algorithmizable method for computing a spectral decomposition of a subshift of finite type is also presented.
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We give a computable condition for topological transitivity and topological mixing of subshifts of finite type. An algorithmizable method for computing a spectral decomposition of a subshift of finite type is also presented.
Key concepts: Subshift of finite type, Transitive relation, Mathematics, Mixing (physics), Type (biology), Topology (electrical circuits), Set (abstract data type), Pure mathematics