Parikh matrices for powers of words
Acta Informatica(2018)
摘要
Certain upper triangular matrices, termed as Parikh matrices, are often used in the combinatorial study of words. Given a word, the Parikh matrix of that word elegantly computes the number of occurrences of certain predefined subwords in that word. In this paper, we compute the Parikh matrix of any word raised to an arbitrary power. Furthermore, we propose canonical decompositions of both Parikh matrices and words into normal forms. Finally, given a Parikh matrix, the relation between its normal form and the normal forms of words in the corresponding M -equivalence class is established.
更多查看译文
关键词
68R15,05A05
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络