Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Jan Manuch"'
Autor:
Ján Maňuch
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 4, Iss 2 (2001)
Let X be a two-element set of words over a finite alphabet. If a bi-infinite word possesses two X-factorizations which are not shiftequivalent, then the primitive roots of the words in X are conjugates. Note, that this is a strict sharpening of a def
Externí odkaz:
https://doaj.org/article/b9f13bf7b4c84bb8aa781dafd92f68ca
Autor:
Ján Maňuch
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 4 no. 2 (2001)
Let X be a two-element set of words over a finite alphabet. If a bi-infinite word possesses two X-factorizations which are not shiftequivalent, then the primitive roots of the words in X are conjugates. Note, that this is a strict sharpening of a def
Externí odkaz:
https://doaj.org/article/a922d248fe92468fb15aefe15b41f5a6
Publikováno v:
Journal of Computational Geometry, Vol 7, Iss 2 (2015)
We show that in the hierarchical tile assembly model, if there is a producible assembly that overlaps a nontrivial translation of itself consistently (i.e., the pattern of tile types in the overlap region is identical in both translations), then arbi
Externí odkaz:
https://doaj.org/article/75d93c8c949d45f5a816166ef1ba229e