Parikh matrices for powers of words
From MaRDI portal
Abstract: 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1735821 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- A new operator over Parikh languages
- A sharpening of the Parikh mapping
- BINARY AMIABLE WORDS
- Characterization of a word by its subwords
- Criteria for the matrix equivalence of words
- Enriching Parikh matrix mappings
- Extending Parikh matrices
- Generalizations of Parikh mappings
- Injectivity of the Parikh matrix mappings revisited
- ON PARIKH MATRICES
- ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
- On Context-Free Languages
- On \(M\)-equivalence and strong \(M\)-equivalence for Parikh matrices
- On a conjecture about Parikh matrices
- On core words and the Parikh matrix mapping
- On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
- Parikh matrices and Parikh rewriting systems
- Parikh matrices and amiable words
- Properties of Parikh matrices of binary words obtained by an extension of a restricted shuffle operator
- Some algebraic aspects of Parikh \(q\)-matrices
- Some alternatives to Parikh matrices using string kernels
- Subword histories and Parikh matrices
- Subword occurrences, Parikh matrices and Lyndon images
Cited in
(15)- Parikh determinants
- Parikh Matrices: Subword Indicators and Degrees of Ambiguity
- Criteria for the matrix equivalence of words
- Power sums associated with certain recursive procedures on words
- Parikh q-Matrices and q-Ambiguous Words
- Product of Parikh matrices and commutativity
- A new study of Parikh matrices restricted to terms
- Counting subwords in circular words and their Parikh matrices
- Words containing a basis for the algebra of all matrices
- Word representations of \(m\times n\times p\) proper arrays
- Parikh matrices and strong \(M\)-equivalence
- Erasure and error correcting ability of Parikh matrices
- Algebraic properties of Parikh matrices of binary picture arrays
- scientific article; zbMATH DE number 5654541 (Why is no real title available?)
- PARIKH MATRIX MAPPING AND LANGUAGES
This page was built for publication: Parikh matrices for powers of words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2317835)
