POWER SUMS ASSOCIATED WITH CERTAIN RECURSIVE PROCEDURES ON WORDS

DOI10.1142/S0129054111008003zbMath1223.68069OpenAlexW1984946819MaRDI QIDQ3076618

Arto Salomaa

Publication date: 23 February 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054111008003

zbMATH Keywords

power sumsubwordD0L systemscattered subwordParikh matrixposition of letterThue morphismword equivalence

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (1)

On Prouhet's solution to the equal powers problem

Cites Work

• Some characterizations of Parikh matrix equivalent binary words
• The origins of combinatorics on words
• Criteria for the matrix equivalence of words
• On some generalizations of the Thue-Morse morphism.
• Subword histories and Parikh matrices
• Extending Parikh matrices
• Subword balance, position indices and power sums
• Connections between subwords and certain matrix mappings
• Independence of certain quantities indicating subword occurrences
• A sharpening of the Parikh mapping
• SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES

This page was built for publication: POWER SUMS ASSOCIATED WITH CERTAIN RECURSIVE PROCEDURES ON WORDS