Erasure and error correcting ability of Parikh matrices
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5074393 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 2182445 (Why is no real title available?)
- scientific article; zbMATH DE number 7283890 (Why is no real title available?)
- A new study of Parikh matrices restricted to terms
- A sharpening of the Parikh mapping
- Algebraic properties of Parikh matrices of binary picture arrays
- BINARY AMIABLE WORDS
- Criteria for the matrix equivalence of words
- Elementary matrix equivalence and core transformation graphs for Parikh matrices
- Injectivity of the Parikh matrix mappings revisited
- ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
- On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
- PARIKH MATRIX MAPPING AND LANGUAGES
- Parikh matrices and amiable words
- Parikh matrices for powers of words
- Parikh motivated study on repetitions in words
- Parikh q-Matrices and q-Ambiguous Words
- Parikh word representability of bipartite permutation graphs
- Parikh-friendly permutations and uniformly Parikh-friendly words
- Reducing the ambiguity of Parikh matrices
- Some characterizations of Parikh matrix equivalent binary words
- Some results on Parikh word representable graphs and partitions
- Strong \((2 \cdot t)\) and strong \((3 \cdot t)\) transformations for strong \(M\)-equivalence
- Subword histories and associated matrices
- \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited
Cited in
(2)
This page was built for publication: Erasure and error correcting ability of Parikh matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2059903)
