Parikh Matrices and Strong M-Equivalence
From MaRDI portal
Publication:2833541
DOI10.1142/S0129054116500155zbMath1353.68228arXiv1501.07354MaRDI QIDQ2833541
Publication date: 18 November 2016
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.07354
Related Items (6)
Elementary matrix equivalence and core transformation graphs for Parikh matrices ⋮ Order of weak \(M\)-relation and Parikh matrices ⋮ Algebraic properties of Parikh \texttt{q}-matrices on two-dimensional words ⋮ On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices ⋮ On M-Equivalence and Strong M-Equivalence for Parikh Matrices ⋮ Strong (2 ⋅ t) and Strong (3 ⋅ t) Transformations for Strong M-Equivalence
Cites Work
- Some characterizations of Parikh matrix equivalent binary words
- Subword histories and associated matrices
- Criteria for the matrix equivalence of words
- Subword histories and Parikh matrices
- Core words and Parikh matrices
- Parikh matrices and amiable words
- Connections between subwords and certain matrix mappings
- Independence of certain quantities indicating subword occurrences
- A sharpening of the Parikh mapping
- BINARY AMIABLE WORDS
- ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
- On Core Words and the Parikh Matrix Mapping
- On Context-Free Languages
This page was built for publication: Parikh Matrices and Strong M-Equivalence
