A word is closed if it contains a proper factor that occurs both as a prefix and as a suffix but does not have internal occurrences, otherwise it is open. We deal with the sequence of open and closed prefixes of Sturmian words and prove that this sequence characterizes every finite or infinite Sturmian word up to isomorphisms of the alphabet. We then characterize the combinatorial structure of the sequence of open and closed prefixes of standard Sturmian words. We prove that every standard Sturmian word, after swapping its first letter, can be written as an infinite product of squares of reversed standard words.
Open and Closed Prefixes of Sturmian Words / DE LUCA, Alessandro; Gabriele, Fici. - 8079:(2013), pp. 132-142. (Intervento presentato al convegno WORDS 2013 tenutosi a Turku, Finland nel 16–20 settembre 2013) [10.1007/978-3-642-40579-2_15].
Open and Closed Prefixes of Sturmian Words
DE LUCA, ALESSANDRO;
2013
Abstract
A word is closed if it contains a proper factor that occurs both as a prefix and as a suffix but does not have internal occurrences, otherwise it is open. We deal with the sequence of open and closed prefixes of Sturmian words and prove that this sequence characterizes every finite or infinite Sturmian word up to isomorphisms of the alphabet. We then characterize the combinatorial structure of the sequence of open and closed prefixes of standard Sturmian words. We prove that every standard Sturmian word, after swapping its first letter, can be written as an infinite product of squares of reversed standard words.| File | Dimensione | Formato | |
|---|---|---|---|
|
1306.2254.pdf
accesso aperto
Tipologia:
Documento in Pre-print
Licenza:
Dominio pubblico
Dimensione
142.46 kB
Formato
Adobe PDF
|
142.46 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
