Zobrazeno 1 - 10
of 143
pro vyhledávání: '"Thue-Morse morphism"'
Autor:
Rampersad, Narad
In 1982, Seebold showed that the only overlap-free binary words that are the fixed points of non-identity morphisms are the Thue-Morse word and its complement. We strengthen Seebold's result by showing that the same result holds if the term 'overlap-
Externí odkaz:
http://arxiv.org/abs/math/0307401
Kniha
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Patrice Séébold
Publikováno v:
Theoretical Computer Science. 292(1):283-298
In 1912, the Norwegian mathematician Axel Thue was the first to describe an overlap-free binary infinite word. This word was generated by a morphism which is called, since the works of Morse, the Thue–Morse morphism. Here, we present two generaliza
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3821ea1d4d9742ecc8b668f746f847d5
Autor:
Narad Rampersad
Publikováno v:
International Journal of Foundations of Computer Science. 16:755-766
In 1982, Séébold showed that the only overlap-free binary words that are the fixed points of non-identity morphisms are the Thue–Morse word and its complement. We strengthen Séébold's result by showing that the same result holds if the term 'ov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::95233b69e18e5811d2e4b79885101989
https://doi.org/10.1142/s0129054105003273
https://doi.org/10.1142/s0129054105003273
Autor:
Narad Rampersad
Publikováno v:
Developments in Language Theory ISBN: 9783540240143
Developments in Language Theory
Developments in Language Theory
In 1982, Seebold showed that the only overlap-free binary words that are the fixed points of non-identity morphisms are the Thue–Morse word and its complement. We strengthen Seebold’s result by showing that the same result holds if the term ‘ov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5cd56879b0cac65a255d49d0ac83339f
https://doi.org/10.1007/978-3-540-30550-7_30
https://doi.org/10.1007/978-3-540-30550-7_30
Morphisms are widely studied combinatorial objects that can be used for generating infinite families of words. In the context of Information theory, injective morphisms are called (variable length) codes. In Data compression, the morphisms, combined
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::40c05defe104123912d1493b72c78def
Autor:
Rampersad, Narad
Publikováno v:
International Journal of Foundations of Computer Science; Aug2005, Vol. 16 Issue 4, p755-766, 12p
Autor:
Patrice Séébold
Publikováno v:
Theoretical Computer Science. 307:179-197
Prouhet words are a natural generalization, over alphabets with more than two letters, of the well known binary Thue–Morse word.We give a unique factorization of these words in a sequence of decreasing Lyndon words, then generalizing such a decompo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::675a221b4dae346cb5e22e6fae1a65d6
https://doi.org/10.1016/s0304-3975(03)00100-2
https://doi.org/10.1016/s0304-3975(03)00100-2