Injectivity of the Parikh matrix mappings revisited
From MaRDI portal
Publication:3409998
zbMATH Open1104.68058MaRDI QIDQ3409998FDOQ3409998
Authors: Virgil Nicolae Şerbănuţă, Traian Şerbănuţă 
Publication date: 21 November 2006
Recommendations
Cited In (24)
- Subword histories and associated matrices
- Title not available (Why is that?)
- On a conjecture about Parikh matrices
- Blocksequences of \(k\)-local words
- Parikh Matrices: Subword Indicators and Degrees of Ambiguity
- Subsequence Invariants
- Criteria for the matrix equivalence of words
- On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
- Elementary matrix equivalence and core transformation graphs for Parikh matrices
- Parikh q-Matrices and q-Ambiguous Words
- On \(M\)-equivalence and strong \(M\)-equivalence for Parikh matrices
- Independence of certain quantities indicating subword occurrences
- A new study of Parikh matrices restricted to terms
- Counting subwords in circular words and their Parikh matrices
- Order of weak \(M\)-relation and Parikh matrices
- Core words and Parikh matrices
- Subword balance, position indices and power sums
- \(M\)-equivalence of Parikh matrix over a ternary alphabet
- Parikh-friendly permutations and uniformly Parikh-friendly words
- Erasure and error correcting ability of Parikh matrices
- \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited
- Parikh matrices for powers of words
- Strong \((2 \cdot t)\) and strong \((3 \cdot t)\) transformations for strong \(M\)-equivalence
- Freeness problem for matrix semigroups of Parikh matrices
Uses Software
This page was built for publication: Injectivity of the Parikh matrix mappings revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3409998)
