On M-Equivalence and Strong M-Equivalence for Parikh Matrices
From MaRDI portal
Publication:4639934
DOI10.1142/S0129054118500065zbMath1387.68193MaRDI QIDQ4639934
Wen Chean Teh, Ghajendran Poovanandran
Publication date: 14 May 2018
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Combinatorics on words (68R15) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)
Related Items (8)
Elementary matrix equivalence and core transformation graphs for Parikh matrices ⋮ Order of weak \(M\)-relation and Parikh matrices ⋮ \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited ⋮ Algebraic properties of Parikh \texttt{q}-matrices on two-dimensional words ⋮ \(M\)-equivalence of Parikh matrix over a ternary alphabet ⋮ Unnamed Item ⋮ Strong (2 ⋅ t) and Strong (3 ⋅ t) Transformations for Strong M-Equivalence ⋮ Parikh matrices for powers of words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a conjecture about Parikh matrices
- Some characterizations of Parikh matrix equivalent binary words
- 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
- Separability of M-Equivalent Words by Morphisms
- Parikh Matrices and Strong M-Equivalence
- PRODUCT OF PARIKH MATRICES AND COMMUTATIVITY
- MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
- A sharpening of the Parikh mapping
- BINARY AMIABLE WORDS
- ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
- Parikh Matrices and Parikh Rewriting Systems
- On Core Words and the Parikh Matrix Mapping
- A New Operator over Parikh Languages
- On Context-Free Languages
This page was built for publication: On M-Equivalence and Strong M-Equivalence for Parikh Matrices
