| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437255 | Theoretical Computer Science | 2012 | 6 Pages |
Abstract
In [7], Séébold (1998) announced that Sturmian words generated by morphisms are all rigid. There was a gap in the proof. This gap is corrected here to complete a combinatorial proof of this result.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
