Words and repeated factors.

Carpi, Arturo; de Luca, Aldo

Displaying similar documents to “Words and repeated factors.”

Matrix realizations of pairs of Young tableaux, keys and shuffles.

Azenhas, Olga, Mamede, Ricardo (2004)

Séminaire Lotharingien de Combinatoire [electronic only]

Similarity:

Complete description of substitutions in cylindric algebras and other algebraic logics

Richard Thompson (1993)

Banach Center Publications

Similarity:

On the permutations generated by Sturmian words.

Makarov, M.A. (2009)

Sibirskij Matematicheskij Zhurnal

Similarity:

Actions of the symmetric group generated by comparable sets of integers and Smith invariants.

Azenhas, Olga, Mamede, Ricardo (2007)

Séminaire Lotharingien de Combinatoire [electronic only]

Similarity:

Complexity of testing morphic primitivity

Štěpán Holub, Vojtěch Matocha (2013)

Kybernetika

Similarity:

We analyze an algorithm that decides whether a given word is a fixed point of a nontrivial morphism. We show that it can be implemented to have complexity in $𝒪 (m \cdot n)$ , where $n$ is the length of the word and $m$ the size of the alphabet.

Factor frequencies in generalized Thue-Morse words

Ľubomíra Balková (2012)

Kybernetika

Similarity:

We describe factor frequencies of the generalized Thue-Morse word $𝐭_{b, m}$ defined for $b \geq 2,$ $m \geq 1,$ $b, m \in ℕ$ , as the fixed point starting in $0$ of the morphism $ϕ_{b, m} (k) = k (k + 1) \dots (k + b - 1),$ where $k \in {0, 1, \dots, m - 1}$ and where the letters are expressed modulo $m$ . We use the result of Frid [4] and the study of generalized Thue-Morse words by Starosta [6].

On a connection between the word problem and decidability of the equational theory.

Popov, V.Yu. (2000)

Siberian Mathematical Journal

Similarity:

Lengths of involutions in Coxeter groups.

Perkins, Sarah B., Rowley, Peter J. (2004)

Journal of Lie Theory

Similarity:

Restricted 123-involutions.

Guibert, O., Mansour, Toufik (2002)

Séminaire Lotharingien de Combinatoire [electronic only]

Similarity: