Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 0925.11026
Berstel, Jean; Séébold, Patrice
A characterization of Sturmian morphisms. (English)
[A] Borzyszkowski, Andrzej M. (ed.) et al., Mathematical foundations of computer science 1993. 18th international symposium, MFCS '93, Gdańsk, Poland, August/ September 1993. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 711, 281-290 (1993). ISBN 3-540-57182-5

Summary: A morphism is called Sturmian if it preserves all Sturmian (infinite) words. It is weakly Sturmian if it preserves at least one Sturmian word. We prove that a morphism is Sturmian if and only if it keeps the word $ba^2ba^2baba^2bab$ balanced. As a consequence, weakly Sturmian morphisms are Sturmian. An application to infinite words associated to irrational numbers is given.

MSC 2000:: *11B85 Automata sequences
68R15 Combinatorics on words

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Simple Search

Zentralblatt MATH Berlin [Germany]