Bordered conjugates of words over large alphabets.
Harju, Tero, Nowotka, Dirk (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Counting ordered patterns in words generated by morphisms.”
Bordered conjugates of words over large alphabets.
A note on antichains of words.
Currie, James D. (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
-words over any alphabet with forbidden any 3-subwords.
Doroslovački, Rade, Marković, Olivera (2000)
Novi Sad Journal of Mathematics
Similarity:
Counting words by number of occurrences of some patterns.
Gao, Zhicheng, MacFie, Andrew, Panario, Daniel (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
-words over any alphabet without subword for fixed , and .
Doroslovački, Rade, Marković, Olivera (2000)
Novi Sad Journal of Mathematics
Similarity:
Episturmian words: a survey
Amy Glen, Jacques Justin (2009)
RAIRO - Theoretical Informatics and Applications
Similarity:
In this paper, we survey the rich theory of infinite which generalize to any finite alphabet, in a rather resembling way, the well-known family of on two letters. After recalling definitions and basic properties, we consider that allow for a deeper study of these words. Some properties of factors are described, including factor complexity, palindromes, fractional powers, frequencies, and return words. We also consider lexicographical properties of episturmian words, as well as their...