Parikh matrices and amiable words

DOI10.1016/J.TCS.2007.10.022zbMath1134.68027OpenAlexW1984680065MaRDI QIDQ2474077

Ion Petre, Radu Atanasiu, 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

zbMATH Keywords

Parikh matrix mappingrank distanceamiable wordsscattered subwords

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (38)

On a conjecture about Parikh matrices ⋮ Parikh word representable graphs and morphisms ⋮ Elementary matrix equivalence and core transformation graphs for Parikh matrices ⋮ A New Operator over Parikh Languages ⋮ PRODUCT OF PARIKH MATRICES AND COMMUTATIVITY ⋮ Some Algebraic Aspects of Parikh q-Matrices ⋮ Order of weak \(M\)-relation and Parikh matrices ⋮ A toolkit for Parikh matrices ⋮ \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited ⋮ Some results on Parikh word representable graphs and partitions ⋮ 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 strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices ⋮ Binary Images, M −Vectors, and Ambiguity ⋮ On M-Equivalence and Strong M-Equivalence for Parikh Matrices ⋮ Generalizations of Parikh mappings ⋮ Subword histories and associated matrices ⋮ Criteria for the matrix equivalence of words ⋮ Reducing the ambiguity of Parikh matrices ⋮ SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES ⋮ Strong (2 ⋅ t) and Strong (3 ⋅ t) Transformations for Strong M-Equivalence ⋮ PARIKH MATRIX MAPPING AND LANGUAGES ⋮ PARIKH MATRICES, AMIABILITY AND ISTRAIL MORPHISM ⋮ Certain distance-based topological indices of Parikh word representable graphs ⋮ Unnamed Item ⋮ ON PARIKH MATRICES, AMBIGUITY, AND PRINTS ⋮ Separability of M-Equivalent Words by Morphisms ⋮ Parikh q-Matrices and q-Ambiguous Words ⋮ Wiener-type indices of Parikh word representable graphs ⋮ Erasure and error correcting ability of Parikh matrices ⋮ Parikh Matrices and Strong M-Equivalence ⋮ Parikh matrices for powers of words ⋮ Enriching Parikh matrix mappings ⋮ On Core Words and the Parikh Matrix Mapping ⋮ TWO-DIMENSIONAL DIGITIZED PICTURE ARRAYS AND PARIKH MATRICES ⋮ A New Study of Parikh Matrices Restricted to Terms ⋮ Core words and Parikh matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Some characterizations of Parikh matrix equivalent binary words
• Independence of certain quantities indicating subword occurrences
• MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
• A sharpening of the Parikh mapping
• BINARY AMIABLE WORDS
• On Context-Free Languages

This page was built for publication: Parikh matrices and amiable words