Some characterizations of Parikh matrix equivalent binary words
From MaRDI portal
Publication:834899
DOI10.1016/j.ipl.2004.06.011zbMath1173.68550OpenAlexW1969800340MaRDI QIDQ834899
Publication date: 27 August 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2004.06.011
Related Items (43)
On a conjecture about Parikh matrices ⋮ Elementary matrix equivalence and core transformation graphs for Parikh matrices ⋮ A New Operator over Parikh Languages ⋮ PRODUCT OF PARIKH MATRICES AND COMMUTATIVITY ⋮ On fairness of D0L systems ⋮ Order of weak \(M\)-relation and Parikh matrices ⋮ A toolkit for Parikh matrices ⋮ Algebraic properties of Parikh matrices of binary picture arrays ⋮ \(M\)-equivalence of Parikh matrix over a ternary alphabet ⋮ Characterizations of families of morphisms and words via binomial complexities ⋮ On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices ⋮ ON INEQUALITIES BETWEEN SUBWORD HISTORIES ⋮ Subword balance, position indices and power sums ⋮ ON SUBWORD SYMMETRY OF WORDS ⋮ Binary Images, M −Vectors, and Ambiguity ⋮ On M-Equivalence and Strong M-Equivalence for Parikh Matrices ⋮ Properties of Parikh Matrices of Binary Words Obtained by an Extension of a Restricted Shuffle Operator ⋮ Generalizations of Parikh mappings ⋮ Subword histories and associated matrices ⋮ Parikh matrices and amiable words ⋮ Criteria for the matrix equivalence of words ⋮ Reducing the ambiguity of Parikh matrices ⋮ Connections between subwords and certain matrix mappings ⋮ SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES ⋮ Independence of certain quantities indicating subword occurrences ⋮ PARIKH MATRIX MAPPING AND LANGUAGES ⋮ PARIKH MATRICES, AMIABILITY AND ISTRAIL MORPHISM ⋮ Unnamed Item ⋮ ON PARIKH MATRICES, AMBIGUITY, AND PRINTS ⋮ Separability of M-Equivalent Words by Morphisms ⋮ POWER SUMS ASSOCIATED WITH CERTAIN RECURSIVE PROCEDURES ON WORDS ⋮ Parikh q-Matrices and q-Ambiguous Words ⋮ The binomial equivalence classes of finite words ⋮ ON PARIKH MATRICES ⋮ Erasure and error correcting ability of Parikh matrices ⋮ COMPARING SUBWORD OCCURRENCES IN BINARY D0L SEQUENCES ⋮ Parikh Matrices and Strong M-Equivalence ⋮ 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 ⋮ BINARY AMIABLE WORDS
Cites Work
This page was built for publication: Some characterizations of Parikh matrix equivalent binary words
