A new operator over Parikh languages
From MaRDI portal
Recommendations
Cites work
- A sharpening of the Parikh mapping
- BINARY AMIABLE WORDS
- Closure properties of slender languages
- Core words and Parikh matrices
- Criteria for the matrix equivalence of words
- On Context-Free Languages
- On core words and the Parikh matrix mapping
- ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
- Parikh matrices and amiable words
- Parikh matrices, amiability and Istrail morphism
- PARIKH MATRIX MAPPING AND LANGUAGES
- Product of Parikh matrices and commutativity
- Some characterizations of Parikh matrix equivalent binary words
Cited in
(14)- On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
- A toolkit for Parikh matrices
- \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited
- Algebraic properties of Parikh matrices of binary picture arrays
- Parikh matrices for powers of words
- PARIKH MATRIX MAPPING AND LANGUAGES
- BINARY AMIABLE WORDS
- 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
- A CHARACTERIZATION OF PARIKH SETS OF ET0L LANGUAGES IN TERMS OF P SYSTEMS
- A new study of Parikh matrices restricted to terms
- Reducing the ambiguity of Parikh matrices
- On Wiener indices of Parikh word representable graphs
- Extensions of Parikh matrix of a word to a two-dimensional binary word
This page was built for publication: A new operator over Parikh languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5298313)
