A lower bound for the arithmetical complexity of Sturmian words.

Frid, A.È.

Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only] (2005)

  • Volume: 2, page 14-22
  • ISSN: 1813-3304

How to cite

top

Frid, A.È.. "A lower bound for the arithmetical complexity of Sturmian words.." Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only] 2 (2005): 14-22. <http://eudml.org/doc/53574>.

@article{Frid2005,
author = {Frid, A.È.},
journal = {Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]},
keywords = {infinite words; sequences with minimal block growth; possible growth of arithmetical complexity; sequence entropy},
language = {eng},
pages = {14-22},
publisher = {Institut Matematiki Im. S.L. Soboleva, SO RAN},
title = {A lower bound for the arithmetical complexity of Sturmian words.},
url = {http://eudml.org/doc/53574},
volume = {2},
year = {2005},
}

TY - JOUR
AU - Frid, A.È.
TI - A lower bound for the arithmetical complexity of Sturmian words.
JO - Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
PY - 2005
PB - Institut Matematiki Im. S.L. Soboleva, SO RAN
VL - 2
SP - 14
EP - 22
LA - eng
KW - infinite words; sequences with minimal block growth; possible growth of arithmetical complexity; sequence entropy
UR - http://eudml.org/doc/53574
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.