Strong (2 t) and strong (3 t) transformations for strong M-equivalence
From MaRDI portal
Publication:5205026
Abstract: Parikh matrices have been extensively investigated due to their usefulness in studying subword occurrences in words. Due to the dependency of Parikh matrices on the ordering of the alphabet, strong M-equivalence was proposed as an order-independent alternative to M-equivalence in studying words possessing the same Parikh matrix. This paper introduces and studies the notions of strong 2.t and strong 3.t transformations in determining when two ternary words are strongly M-equivalent. The irreducibility of strong 2.t transformations are then scrutinized, exemplified by a structural characterization of irreducible strong 2.2 transformations. The common limitation of these transformations in characterizing strong M-equivalence is then addressed.
Recommendations
- On M-equivalence and strong M-equivalence for Parikh matrices
- Parikh matrices and strong M-equivalence
- Separability of M-equivalent words by morphisms
- Elementary matrix equivalence and core transformation graphs for Parikh matrices
- Algebraic properties of Parikh matrices of words under an extension of Thue morphism
Cites work
- A sharpening of the Parikh mapping
- Connections between subwords and certain matrix mappings
- Criteria for the matrix equivalence of words
- scientific article; zbMATH DE number 1735821 (Why is no real title available?)
- Independence of certain quantities indicating subword occurrences
- Injectivity of the Parikh matrix mappings revisited
- On M-equivalence and strong M-equivalence for Parikh matrices
- On a conjecture about Parikh matrices
- On Context-Free Languages
- ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
- On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
- Parikh matrices and amiable words
- Parikh matrices and strong M-equivalence
- Properties of Parikh matrices of binary words obtained by an extension of a restricted shuffle operator
Cited in
(9)- On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
- Erasure and error correcting ability of Parikh matrices
- A toolkit for Parikh matrices
- Parikh matrices and strong M-equivalence
- On M-equivalence and strong M-equivalence for Parikh matrices
- Reducing the ambiguity of Parikh matrices
- Algebraic properties of Parikh \texttt{q}-matrices on two-dimensional words
- Ternary is still good for Parikh matrices
- Universal rewriting rules for the Parikh matrix injectivity problem
This page was built for publication: Strong \((2 \cdot t)\) and strong \((3 \cdot t)\) transformations for strong \(M\)-equivalence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5205026)
