Where academic tradition
meets the exciting future

Power Sums Associated with Certain Recursive Procedures on Words

Arto Salomaa, Power Sums Associated with Certain Recursive Procedures on Words. International Journal of Foundations of Computer Science 22(1), 261–272, 2011.

Abstract:

We investigate various ways of characterizing words, mainly over a binary
alphabet, using information about the positions of occurrences of
letters in words. We introduce two new measures associated with words,
the position index and sum of position indices. We establish some
characterizations, connections with Parikh matrices, and connectionswith power sums. One particular emphasis concerns the effect of morphisms
and iterated morphisms on words.

BibTeX entry:

@ARTICLE{jSalomaa11a,
  title = {Power Sums Associated with Certain Recursive Procedures on Words},
  author = {Salomaa, Arto},
  journal = {International Journal of Foundations of Computer Science},
  volume = {22},
  number = {1},
  pages = {261–272},
  year = {2011},
  keywords = {position of letter, subword, Parikh matrix, power sum, iterated morphism, Thue morphism, Fibonacci morphism},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Publication Forum rating of this publication: level 2

Edit publication