Zobrazeno 1 - 2
of 2
pro vyhledávání: '"M��tze, Torsten"'
Publikováno v:
Proceedings of STACS 2022
Given integers k ��� 2 and a_1,���,a_k ��� 1, let a: = (a_1,���,a_k) and n: = a_1+���+a_k. An a-multiset permutation is a string of length n that contains exactly a_i symbols i for each i = 1,���,k. In this work we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4d33d0519b0b64d46b73a161e48a126d
https://doi.org/10.1002/jgt.22915
https://doi.org/10.1002/jgt.22915
A universal word for a finite alphabet $A$ and some integer $n\geq 1$ is a word over $A$ such that every word in $A^n$ appears exactly once as a subword (cyclically or linearly). It is well-known and easy to prove that universal words exist for any $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7773ac8fbff07ae3b9fd89ff0d462ccd
