Parikh matrices and amiable words
From MaRDI portal
Publication:2474077
DOI10.1016/J.TCS.2007.10.022zbMATH Open1134.68027OpenAlexW1984680065MaRDI QIDQ2474077FDOQ2474077
Authors: Radu Atanasiu, Ion Petre, Adrian Atanasiu 
Publication date: 5 March 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.10.022
Recommendations
Cites Work
- Title not available (Why is that?)
- A sharpening of the Parikh mapping
- BINARY AMIABLE WORDS
- On Context-Free Languages
- Some characterizations of Parikh matrix equivalent binary words
- MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
- Independence of certain quantities indicating subword occurrences
- A low-complexity distance for DNA strings
Cited In (44)
- Subword histories and associated matrices
- Title not available (Why is that?)
- On a conjecture about Parikh matrices
- On exploring the topological aspects of the chemical structure of the nanotube \(HAC_5C_7[w,t]\)
- Parikh word representable graphs and morphisms
- Enriching Parikh matrix mappings
- Separability of \(M\)-equivalent words by morphisms
- 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
- Product of Parikh matrices and commutativity
- Parikh matrices, amiability and Istrail morphism
- Reducing the ambiguity of Parikh matrices
- On core words and the Parikh matrix mapping
- Some algebraic aspects of Parikh \(q\)-matrices
- A new study of Parikh matrices restricted to terms
- Some results on Parikh word representable graphs and partitions
- Counting subwords in circular words and their Parikh matrices
- Certain distance-based topological indices of Parikh word representable graphs
- Subword occurrences, Parikh matrices and Lyndon images
- Order of weak \(M\)-relation and Parikh matrices
- Core words and Parikh matrices
- \(M\)-equivalence of Parikh matrix over a ternary alphabet
- Binary images, \(M\)-vectors, and ambiguity
- A toolkit for Parikh matrices
- Algebraic properties of Parikh \texttt{q}-matrices on two-dimensional words
- Generalizations of Parikh mappings
- Parikh matrices and strong \(M\)-equivalence
- 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
- BINARY AMIABLE WORDS
- Wiener-type indices of Parikh word representable graphs
- ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
- ON PARIKH MATRICES
- Two-dimensional digitized picture arrays and Parikh matrices
- Parikh matrices for powers of words
- Title not available (Why is that?)
- Morphisms on amiable words
- A new operator over Parikh languages
- PARIKH MATRIX MAPPING AND LANGUAGES
- Strong \((2 \cdot t)\) and strong \((3 \cdot t)\) transformations for strong \(M\)-equivalence
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)
