A sharpening of the Parikh mapping
From MaRDI portal
Recommendations
Cites work
- A characterization of poly-slender context-free languages
- An attempt to define a class of mildly context-sensitive languages
- scientific article; zbMATH DE number 3716838 (Why is no real title available?)
- scientific article; zbMATH DE number 1735821 (Why is no real title available?)
- scientific article; zbMATH DE number 1156871 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- On Context-Free Languages
- On Parikh slender languages and power series
- Some decision problems concerning semilinearity and commutation.
Cited in
(79)- 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
- Generalized mapping for multiset rewriting systems
- A toolkit for 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
- On a conjecture about 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
- 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
- Wiener-type indices of Parikh word representable graphs
- Comparing subword occurrences in binary D0L sequences
- BINARY AMIABLE WORDS
- Several extensions of the Parikh matrix L-morphism
- Generalizations of Parikh mappings
- ON PARIKH MATRICES
- Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism
- scientific article; zbMATH DE number 2080937 (Why is no real title available?)
- 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
- Another generalization of abelian equivalence: binomial complexity of infinite words
- The binomial equivalence classes of finite words
- Context-Freeness of Word-MIX Languages
- Relations on words
- Parikh-friendly permutations and uniformly Parikh-friendly words
- Freeness problem for matrix semigroups of Parikh matrices
- Subword occurrences, Parikh matrices and Lyndon images
- Strong \((2 \cdot t)\) and strong \((3 \cdot 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
- A new study of Parikh matrices restricted to terms
- Reducing the ambiguity of Parikh matrices
- Prouhet array morphism and Parikh \(\mathtt{q}\)-matrix
- Parikh Matrices: Subword Indicators and Degrees of Ambiguity
- Algebraic properties of Parikh \texttt{q}-matrices on two-dimensional words
- Counting subwords in circular words and their Parikh matrices
- M-equivalence of Parikh matrix over a ternary alphabet
- When is context-freeness distinguishable from regularity? An extension of Parikh's theorem
- On Wiener indices of Parikh word representable graphs
- Characterizations of M-equivalence and weak M-relation
- On some 2-binomial coefficients of binary words: geometrical interpretation, partitions of integers, and fair words
- Extensions of Parikh matrix of a word to a two-dimensional binary word
- Ternary is still good for Parikh matrices
- Generalized Parikh matrices for tracking subsequence occurrences
- q-Parikh matrices and q-deformed binomial coefficients of words
- Universal rewriting rules for the Parikh matrix injectivity problem
- Parikh word representable graphs and morphisms
- 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
This page was built for publication: A sharpening of the Parikh mapping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147022)
