Parikh matrices for powers of words
From MaRDI portal
Publication:2317835
DOI10.1007/S00236-018-0327-8zbMATH Open1423.68364arXiv1808.04102OpenAlexW2886388813MaRDI QIDQ2317835FDOQ2317835
Authors: Ghajendran Poovanandran, Wen Chean Teh, Adrian Atanasiu 
Publication date: 13 August 2019
Published in: Acta Informatica (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1808.04102
Recommendations
Cites Work
- Title not available (Why is that?)
- Parikh matrices and amiable words
- On a conjecture about Parikh matrices
- A sharpening of the Parikh mapping
- Some algebraic aspects of Parikh \(q\)-matrices
- Injectivity of the Parikh matrix mappings revisited
- BINARY AMIABLE WORDS
- ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
- ON PARIKH MATRICES
- Title not available (Why is that?)
- Parikh matrices and Parikh rewriting systems
- On core words and the Parikh matrix mapping
- On Context-Free Languages
- Criteria for the matrix equivalence of words
- Subword histories and Parikh matrices
- Extending Parikh matrices
- Generalizations of Parikh mappings
- Some alternatives to Parikh matrices using string kernels
- Subword occurrences, Parikh matrices and Lyndon images
- Characterization of a word by its subwords
- On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
- On \(M\)-equivalence and strong \(M\)-equivalence for Parikh matrices
- Properties of Parikh matrices of binary words obtained by an extension of a restricted shuffle operator
- A new operator over Parikh languages
- Enriching Parikh matrix mappings
Cited In (15)
- Parikh Matrices: Subword Indicators and Degrees of Ambiguity
- Parikh determinants
- 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
- Title not available (Why is that?)
- 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)
