Strong (2 ⋅ t) and Strong (3 ⋅ t) Transformations for Strong M-Equivalence

DOI10.1142/S0129054119500187zbMath1427.68261arXiv1702.03647MaRDI QIDQ5205026

Wen Chean Teh, Ghajendran Poovanandran

Publication date: 10 December 2019

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.03647

zbMATH Keywords

injectivity problemParikh matricessubwordstrong \(M\)-equivalence

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (5)

A toolkit for 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 ⋮ Reducing the ambiguity of Parikh matrices ⋮ Erasure and error correcting ability of Parikh matrices

Cites Work

• Unnamed Item
• Unnamed Item
• On a conjecture about Parikh matrices
• Criteria for the matrix equivalence of words
• On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
• Parikh matrices and amiable words
• Connections between subwords and certain matrix mappings
• Independence of certain quantities indicating subword occurrences
• Parikh Matrices and Strong M-Equivalence
• A sharpening of the Parikh mapping
• 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
• On Context-Free Languages

This page was built for publication: Strong (2 ⋅ t) and Strong (3 ⋅ t) Transformations for Strong M-Equivalence