On normality in shifts of finite type
Formal Languages and Automata Theory
2019-02-27 v2
Abstract
In this paper we consider the notion of normality of sequences in shifts of finite type. A sequence is normal if the frequency of each block exists and is equal to the Parry measure of the block. We give a characterization of normality in terms of incompressibility by lossless transducers. The result was already known in the case of the full shift.
Cite
@article{arxiv.1807.07208,
title = {On normality in shifts of finite type},
author = {Nicolás Álvarez and Olivier Carton},
journal= {arXiv preprint arXiv:1807.07208},
year = {2019}
}