Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 1
How far are ternary words from shuffle squares?
Ayush Basu, Andrzej Ruciński
Izvirni znanstveni članek
Oznake: words over finite alphabet;twins in words;shuffle squares;
A shuffle square is a word which consists of two identical and disjoint, but possibly intertwining subwords. For every natural number n, we construct a ternary word of length n which requires a removal of at least Ω(log²n) of its letters in order to become a shuffle square.
Leto: 2025 Vir: Repozitorij Univerze na Primorskem (RUP)
Št. zadetkov: 1
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: