Power sums associated with certain recursive procedures on words

DOI10.1142/S0129054111008003MaRDI QIDQ3076618zbMATH OpenOpenAlexFDO

Authors 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

D0L systemParikh matrixposition of letterpower sumscattered subwordsubwordThue morphismword equivalence

Mathematics Subject Classification ID

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

Recommendations

• Parikh matrices for powers of words
• Subword balance, position indices and power sums
• Counting powers of words in monoids.
• Subword histories and Parikh matrices
• Parikh matrices and strong M-equivalence

Cites work

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

Cited in

(4)

• An equivalence relation on a set of words of finite length
• Subword balance, position indices and power sums
• On Prouhet's solution to the equal powers problem
• scientific article; zbMATH DE number 1446754 (Why is no real title available?)

This page was built for publication: Power sums associated with certain recursive procedures on words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3076618)