Subword balance, position indices and power sums

DOI10.1016/j.jcss.2010.04.012zbMath1215.68123MaRDI QIDQ1959432

Arto Salomaa

Publication date: 7 October 2010

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2010.04.012

zbMATH Keywords

power sum; iterated morphism; subword; Fibonacci morphism; Parikh matrix; position index sums; position of letter; Thue morphism

Mathematics Subject Classification ID

68R15: Combinatorics on words

68Q45: Formal languages and automata

Related Items

Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism, Newton polygons and the Prouhet-Tarry-Escott problem, Relations on words, POWER SUMS ASSOCIATED WITH CERTAIN RECURSIVE PROCEDURES ON WORDS, Some Algebraic Aspects of Parikh q-Matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some characterizations of Parikh matrix equivalent binary words
• Subword conditions and subword histories
• The origins of combinatorics on words
• The Prouhet-Tarry-Escott problem revisited
• Subword histories and Parikh matrices
• Extending Parikh matrices
• On fairness of D0L systems
• Connections between subwords and certain matrix mappings
• Independence of certain quantities indicating subword occurrences
• MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
• A sharpening of the Parikh mapping
• SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES