1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DM2010
Maximal Complexity of Finite Words
M-C. Anisiu, Z. Blazsik, Z. Kasa
The subword complexity of a finite word of length is a function which associates to each the number of all distinct subwords of having the length . We defin…
cs.DM2010★ 1 cited
Properties of palindromes in finite words
M-C. Anisiu, V. Anisiu, Z. Kasa
We present a method which displays all palindromes of a given length from De Bruijn words of a certain order, and also a recursive one which constructs all palindromes of length $n…