Fibonacci morphisms and Sturmian words (Q1177169): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q1806108 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Tero J.Harju / rank | |||
Normal rank | |||
Revision as of 13:47, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fibonacci morphisms and Sturmian words |
scientific article |
Statements
Fibonacci morphisms and Sturmian words (English)
0 references
26 June 1992
0 references
The paper solves four problems on binary morphisms proposed by \textit{M. Kósa} [Bull. EATCS 32, 331-333 (1987)].
0 references
Sturmian words
0 references
free monoids
0 references
morphisms
0 references
