Order of weak \(M\)-relation and Parikh matrices
From MaRDI portal
Publication:1659987
DOI10.1016/j.tcs.2018.04.042zbMath1398.68426OpenAlexW2801791524MaRDI QIDQ1659987
Wen Chean Teh, K. G. Subramanian, Somnath Bera
Publication date: 23 August 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.04.042
Related Items (4)
Parikh word representability of bipartite permutation graphs ⋮ \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited ⋮ \(M\)-equivalence of Parikh matrix over a ternary alphabet ⋮ A New Study of Parikh Matrices Restricted to Terms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a conjecture about Parikh matrices
- Relations on words
- Some characterizations of Parikh matrix equivalent binary words
- Subword histories and associated matrices
- Criteria for the matrix equivalence of words
- Reconstruction of sequences
- Reconstruction from subsequences.
- On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
- Extending Parikh matrices
- Core words and Parikh matrices
- Parikh matrices and amiable words
- Independence of certain quantities indicating subword occurrences
- Parikh Matrices and Strong M-Equivalence
- TWO-DIMENSIONAL DIGITIZED PICTURE ARRAYS AND PARIKH MATRICES
- PRODUCT OF PARIKH MATRICES AND COMMUTATIVITY
- A sharpening of the Parikh mapping
- Some Algebraic Aspects of Parikh q-Matrices
- BINARY AMIABLE WORDS
- ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
- 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
- Parikh Matrices and Parikh Rewriting Systems
- SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES
- On Context-Free Languages
This page was built for publication: Order of weak \(M\)-relation and Parikh matrices
