ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
From MaRDI portal
Publication:3620619
DOI10.1142/S0129054109006498zbMath1170.68503MaRDI QIDQ3620619
Publication date: 14 April 2009
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Related Items
On M-Equivalence and Strong M-Equivalence for Parikh Matrices, Unnamed Item, SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES, Strong (2 ⋅ t) and Strong (3 ⋅ t) Transformations for Strong M-Equivalence, 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, Criteria for the matrix equivalence of words, Order of weak \(M\)-relation and Parikh matrices, On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices, Erasure and error correcting ability of Parikh matrices, \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited, Parikh matrices for powers of words, Core words and 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, Some Algebraic Aspects of Parikh q-Matrices
Cites Work
