EUDML | Counting ordered patterns in words generated by morphisms.

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “Counting ordered patterns in words generated by morphisms.”

Bordered conjugates of words over large alphabets.

Harju, Tero, Nowotka, Dirk (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A note on antichains of words.

Currie, James D. (1995)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

$n$ -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:

$n$ -words over any alphabet without subword $a \underset{k - 1}{\underset{︸}{b \dots b}} a$ for fixed $a$ , $b$ and $k$ .

Doroslovački, Rade, Marković, Olivera (2000)

Novi Sad Journal of Mathematics

Similarity: