Product of Parikh matrices and commutativity
From MaRDI portal
Publication:2909192
DOI10.1142/S0129054112500049zbMATH Open1254.68194DBLPjournals/ijfcs/MahalingamS12OpenAlexW2153809352WikidataQ62046592 ScholiaQ62046592MaRDI QIDQ2909192FDOQ2909192
Kalpana Mahalingam, K. G. Subramanian
Publication date: 30 August 2012
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054112500049
Cites Work
- Title not available (Why is that?)
- Parikh matrices and amiable words
- A sharpening of the Parikh mapping
- BINARY AMIABLE WORDS
- ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
- ON PARIKH MATRICES
- Some characterizations of Parikh matrix equivalent binary words
- Criteria for the matrix equivalence of words
- Subword histories and Parikh matrices
- Extending Parikh matrices
- SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES
- MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
- PARIKH MATRIX MAPPING AND LANGUAGES
Cited In (14)
- Properties of Parikh Matrices of Binary Words Obtained by an Extension of a Restricted Shuffle Operator
- On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
- Title not available (Why is that?)
- Matrix valued paraproducts
- Reducing the ambiguity of Parikh matrices
- Counting subwords in circular words and their Parikh matrices
- Order of weak \(M\)-relation and Parikh matrices
- Freeness Problem for Matrix Semigroups of Parikh Matrices
- A New Operator over Parikh Languages
- A toolkit for Parikh matrices
- Some new connections between matrix products for partitioned and non-partitioned matrices
- BINARY AMIABLE WORDS
- Two-dimensional digitized picture arrays and Parikh matrices
- On M-Equivalence and Strong M-Equivalence for Parikh Matrices
This page was built for publication: Product of Parikh matrices and commutativity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909192)
