This chapter presents some of the links between automata theory and symbolic dynamics. The emphasis is on two particular points. The first one is the interplay between some particular classes of automata, such as local automata and results on embeddings of shifts of finite type. The second one is the connection between syntactic semigroups and the classification of sofic shifts up to conjugacy.

A sequence of diffeomorphisms along compact Riemannian manifolds is Anosov family if the tangent bundle split into expanding and contracting subspaces. For a certain class families, we construct Markov partitions provide an associated symbolic representation which given by non-stationary subshift finite type (NSFT). Moreover, induced coding on each component NSFT shares several properties with ...

A novel general method for constructing nonparametric hypotheses tests based on the field of symbolic analysis is introduced in this paper. Several existing entropy that have been used testing central several branches science (particularly economics and statistics) are particular cases approach. This family uses few assumptions, which increases applicability any symbolic-based test. Additionall...