MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
From MaRDI portal
Publication:3021998
DOI10.1142/S0129054104002418zbMath1067.68117MaRDI QIDQ3021998
Alexandru Mateescu, Arto Salomaa
Publication date: 22 June 2005
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, SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES, Parikh q-Matrices and q-Ambiguous Words, On Core Words and the Parikh Matrix Mapping, Some characterizations of Parikh matrix equivalent binary words, Subword conditions and subword histories, Subword histories and associated matrices, Criteria for the matrix equivalence of words, Elementary matrix equivalence and core transformation graphs for Parikh matrices, On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices, Subword balance, position indices and power sums, Certain distance-based topological indices of Parikh word representable graphs, \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited, Core words and Parikh matrices, Binary image reconstruction based on prescribed numerical information, On fairness of D0L systems, Some results on Parikh word representable graphs and partitions, 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, 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, Some Algebraic Aspects of Parikh q-Matrices, 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
