On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices

DOI10.1016/J.TCS.2017.11.016zbMath1392.68334OpenAlexW2769085146WikidataQ123121911 ScholiaQ123121911MaRDI QIDQ1704577

Ghajendran Poovanandran, Wen Chean Teh, Adrian Atanasiu

Publication date: 12 March 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.11.016

zbMATH Keywords

\(M\)-equivalenceinjectivity problemsubwordprint wordstrong \(M\)-equivalence

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (10)

Elementary matrix equivalence and core transformation graphs for Parikh matrices ⋮ Order of weak \(M\)-relation and Parikh matrices ⋮ Parikh word representability of bipartite permutation graphs ⋮ \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited ⋮ Counting subwords in circular words and their Parikh matrices ⋮ Freeness Problem for Matrix Semigroups of Parikh Matrices ⋮ Strong (2 ⋅ t) and Strong (3 ⋅ t) Transformations for Strong M-Equivalence ⋮ Erasure and error correcting ability of Parikh matrices ⋮ Parikh matrices for powers of words ⋮ A New Study of Parikh Matrices Restricted to Terms

Cites Work

• Unnamed Item
• Unnamed Item
• On a conjecture about Parikh matrices
• Some characterizations of Parikh matrix equivalent binary words
• An introduction to the Heisenberg group and the sub-Riemannian isoperimetric problem
• 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
• Strong (2 ⋅ t) and Strong (3 ⋅ t) Transformations for Strong M-Equivalence
• 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 strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices