On the permutations generated by Sturmian words.
Sibirskij Matematicheskij Zhurnal (2009)
- Volume: 50, Issue: 4, page 850-857
- ISSN: 0037-4474
Access Full Article
topHow to cite
topMakarov, M.A.. "On the permutations generated by Sturmian words.." Sibirskij Matematicheskij Zhurnal 50.4 (2009): 850-857. <http://eudml.org/doc/225880>.
@article{Makarov2009,
author = {Makarov, M.A.},
journal = {Sibirskij Matematicheskij Zhurnal},
keywords = {infinite permutation; Sturmian word; combinatorial complexity; Rauzy graph; arithmetic complexity; Kamae complexity},
language = {eng},
number = {4},
pages = {850-857},
publisher = {Sibirskoe Otdelenie Rossijskoj Akademii Nauk, Institut Matematiki Im. S. L. Soboleva SO RAN, Novosibirsk; Izdatel'stvo Instituta Matematiki},
title = {On the permutations generated by Sturmian words.},
url = {http://eudml.org/doc/225880},
volume = {50},
year = {2009},
}
TY - JOUR
AU - Makarov, M.A.
TI - On the permutations generated by Sturmian words.
JO - Sibirskij Matematicheskij Zhurnal
PY - 2009
PB - Sibirskoe Otdelenie Rossijskoj Akademii Nauk, Institut Matematiki Im. S. L. Soboleva SO RAN, Novosibirsk; Izdatel'stvo Instituta Matematiki
VL - 50
IS - 4
SP - 850
EP - 857
LA - eng
KW - infinite permutation; Sturmian word; combinatorial complexity; Rauzy graph; arithmetic complexity; Kamae complexity
UR - http://eudml.org/doc/225880
ER -
Citations in EuDML Documents
topNotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.