Primitive words, or strings over a finite alphabet that cannot be written as a power of another string, play an important role in formal language theory, coding theory, and combinatorics on words toâ€¦ (More)

We study the combinatorics of vtm, a variant of the Thue-Morse word generated by the non-uniform morphism 0 7â†’ 012, 1 7â†’ 02, 2 7â†’ 1 starting with 0. This infinite ternary sequence appears a lot inâ€¦ (More)

The concepts of unique decipherability, multiset decipherability, and set decipherability of codes were developed to handle some special problems in the transmission of information. In uniqueâ€¦ (More)

The notion of an unavoidable set of words appears frequently in the fields of mathematics and theoretical computer science, in particular with its connection to the study of combinatorics on words.â€¦ (More)

A well known result of Fraenkel and Simpson states that the number of distinct squares in a word of length n is bounded by 2n since at each position there are at most two distinct squares whose lastâ€¦ (More)

A complete set of generators for Straubingâ€™s dot-depth-two monoids has been characterized as a set of quotients of the form A*/ wCn, , ,,, where n and M denote positive integers, A* denotes the freeâ€¦ (More)

In this paper, we investigate partial words, or finite sequences that may have some undefined positions called holes, of maximum subword complexity. The subword complexity function of a partial wordâ€¦ (More)