Some characterizations of Parikh matrix equivalent binary words
From MaRDI portal
Publication:834899
DOI10.1016/j.ipl.2004.06.011zbMath1173.68550MaRDI 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
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, Unnamed Item, The binomial equivalence classes of finite words, SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES, Parikh q-Matrices and q-Ambiguous Words, On Core Words and the Parikh Matrix Mapping, A New Operator over Parikh Languages, Reducing the ambiguity of Parikh matrices, A New Study of Parikh Matrices Restricted to Terms, On a conjecture about Parikh matrices, Subword histories and associated matrices, Criteria for the matrix equivalence of words, 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, Subword balance, position indices and power sums, Erasure and error correcting ability of Parikh matrices, Algebraic properties of Parikh matrices of binary picture arrays, Core words and Parikh matrices, On fairness of D0L systems, Parikh matrices and amiable words, Connections between subwords and certain matrix mappings, Independence of certain quantities indicating subword occurrences, 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, POWER SUMS ASSOCIATED WITH CERTAIN RECURSIVE PROCEDURES ON WORDS, COMPARING SUBWORD OCCURRENCES IN BINARY D0L SEQUENCES, BINARY AMIABLE WORDS, ON INEQUALITIES BETWEEN SUBWORD HISTORIES, ON SUBWORD SYMMETRY OF WORDS, Generalizations of Parikh mappings, ON PARIKH MATRICES, AMBIGUITY, AND PRINTS, ON PARIKH MATRICES
Cites Work
