On some properties of the decoding of admissible words for primitive substitutions
Zapiski Nauchnykh Seminarov POMI, Representation theory, dynamical systems, combinatorial and algoritmic methods. Part I, Tome 223 (1995), pp. 127-136
Cet article a éte moissonné depuis la source Math-Net.Ru
A number of properties of decoding for admissible sequences are studied, some of which were studied earlier, and some are new. Several conditions under which a substitution possesses these properties are obtained. Bibliography: 10 titles.
@article{ZNSL_1995_223_a5,
author = {A. N. Livshits},
title = {On some properties of the decoding of admissible words for primitive substitutions},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {127--136},
year = {1995},
volume = {223},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_1995_223_a5/}
}
A. N. Livshits. On some properties of the decoding of admissible words for primitive substitutions. Zapiski Nauchnykh Seminarov POMI, Representation theory, dynamical systems, combinatorial and algoritmic methods. Part I, Tome 223 (1995), pp. 127-136. http://geodesic.mathdoc.fr/item/ZNSL_1995_223_a5/