A New Study of Parikh Matrices Restricted to Terms
From MaRDI portal
Publication:5859640
DOI10.1142/S0129054120500306zbMath1458.68150MaRDI QIDQ5859640
Azhana Ahmad, Wen Chean Teh, K. G. Subramanian, Zi Jing Chern
Publication date: 19 April 2021
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Related Items (1)
Cites Work
- On a conjecture about Parikh matrices
- Some characterizations of Parikh matrix equivalent binary words
- Criteria for the matrix equivalence of words
- Elementary matrix equivalence and core transformation graphs for Parikh matrices
- Order of weak \(M\)-relation and Parikh matrices
- On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
- Core words and Parikh matrices
- Parikh matrices and amiable words
- A sharpening of the Parikh mapping
- BINARY AMIABLE WORDS
- ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
- Properties of Parikh Matrices of Binary Words Obtained by an Extension of a Restricted Shuffle Operator
- A New Operator over Parikh Languages
- On Context-Free Languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A New Study of Parikh Matrices Restricted to Terms
