Parikh matrices and amiable words
From MaRDI portal
Publication:2474077
Recommendations
Cites work
- A low-complexity distance for DNA strings
- A sharpening of the Parikh mapping
- BINARY AMIABLE WORDS
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- Independence of certain quantities indicating subword occurrences
- MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
- On Context-Free Languages
- Some characterizations of Parikh matrix equivalent binary words
Cited in
(49)- Elementary matrix equivalence and core transformation graphs for Parikh matrices
- Order of weak \(M\)-relation and Parikh matrices
- On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
- Certain distance-based topological indices of Parikh word representable graphs
- Erasure and error correcting ability of Parikh matrices
- A toolkit for Parikh matrices
- \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited
- Parikh matrices for powers of words
- Core words and Parikh matrices
- Some results on Parikh word representable graphs and partitions
- On a conjecture about Parikh matrices
- Separability of M-equivalent words by morphisms
- Parikh matrices and strong M-equivalence
- Enriching Parikh matrix mappings
- Two-dimensional digitized picture arrays and Parikh matrices
- Product of Parikh matrices and commutativity
- Binary images, M-vectors, and ambiguity
- PARIKH MATRIX MAPPING AND LANGUAGES
- Parikh matrices, amiability and Istrail morphism
- Some algebraic aspects of Parikh q-matrices
- Wiener-type indices of Parikh word representable graphs
- BINARY AMIABLE WORDS
- Generalizations of Parikh mappings
- ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
- ON PARIKH MATRICES
- scientific article; zbMATH DE number 5654541 (Why is no real title available?)
- scientific article; zbMATH DE number 1735821 (Why is no real title available?)
- On M-equivalence and strong M-equivalence for Parikh matrices
- Morphisms on amiable words
- Parikh-friendly permutations and uniformly Parikh-friendly words
- Subword occurrences, Parikh matrices and Lyndon images
- Strong \((2 \cdot t)\) and strong \((3 \cdot t)\) transformations for strong \(M\)-equivalence
- Parikh q-Matrices and q-Ambiguous Words
- On core words and the Parikh matrix mapping
- A new operator over Parikh languages
- A new study of Parikh matrices restricted to terms
- Reducing the ambiguity of Parikh matrices
- Algebraic properties of Parikh \texttt{q}-matrices on two-dimensional words
- Counting subwords in circular words and their Parikh matrices
- M-equivalence of Parikh matrix over a ternary alphabet
- On exploring the topological aspects of the chemical structure of the nanotube \(HAC_5C_7[w,t]\)
- Characterizations of M-equivalence and weak M-relation
- Extensions of Parikh matrix of a word to a two-dimensional binary word
- Ternary is still good for Parikh matrices
- Generalized Parikh matrices for tracking subsequence occurrences
- Universal rewriting rules for the Parikh matrix injectivity problem
- Parikh word representable graphs and morphisms
- Subword histories and associated matrices
- Criteria for the matrix equivalence of words
This page was built for publication: Parikh matrices and amiable words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2474077)
