A sharpening of the Parikh mapping
From MaRDI portal
Publication:3147022
DOI10.1051/ita:2001131zbMath1005.68092MaRDI QIDQ3147022
Kai Salomaa, Alexandru Mateescu, Arto Salomaa, Sheng Yu
Publication date: 18 September 2002
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2001__35_6_551_0
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, Freeness Problem for Matrix Semigroups of Parikh Matrices, SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES, Strong (2 ⋅ t) and Strong (3 ⋅ t) Transformations for Strong M-Equivalence, 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, Several extensions of the Parikh matrix \(L\)-morphism, Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism, Another generalization of abelian equivalence: binomial complexity of infinite words, Relations on words, 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, Order of weak \(M\)-relation and Parikh matrices, On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices, Subword histories and Parikh matrices, Extending Parikh matrices, Subword balance, position indices and power sums, Certain distance-based topological indices of Parikh word representable graphs, Erasure and error correcting ability of Parikh matrices, Parikh word representability of bipartite permutation graphs, \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited, A compactness property of the \(k\)-abelian monoids, Algebraic properties of Parikh matrices of binary picture arrays, The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs, Parikh matrices for powers of words, 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, Structural properties of word representable graphs, 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, MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY, PARIKH MATRIX MAPPING AND LANGUAGES, PARIKH MATRICES, AMIABILITY AND ISTRAIL MORPHISM, POWER SUMS ASSOCIATED WITH CERTAIN RECURSIVE PROCEDURES ON WORDS, COUNTING SUBWORDS USING A TRIE AUTOMATON, Some Algebraic Aspects of Parikh q-Matrices, COMPARING SUBWORD OCCURRENCES IN BINARY D0L SEQUENCES, BINARY AMIABLE WORDS, Generalizations of Parikh mappings, ON PARIKH MATRICES
Cites Work
