Combinatorical and Algebraic Structures Seminar
Session details
| Date: | 5.5.2006 |
| Speaker: | Ľubomíra Balková, FNSPE, Czech Technical University |
| Title: | Return Words of Infinite Words Associated with Simple Parry Numbers |
| Abstract: | (spoluautoři: E. Pelantová and W. Steiner) For infinite recurrent words over a finite alphabet, it is interesting to study the set of all return words, where a return word of a factor $w$ is the word beginning with an occurrence of $w$ and ending exactly before the next occurrence of $w$ in the infinite word. To understand without difficulties this notion, there is written a prefix of an infinite word where two different return words of the factor $0100$ are underlined: $$0\underline{010}010010\underline{01001}01001\dots \,.$$ Last time, Petr Ambro\v{z} introduced infinite words associated with simple Parry numbers and described the subword and palindromic complexity. Let us follow it up with description of return words for the same type of infinite words. |
Return to index.
last update: 27.9.2007, webmaster: Petr Ambrož