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

DOI10.1016/J.TCS.2017.11.016MaRDI QIDQ1704577zbMATH OpenOpenAlexWikidataFDO

Authors Wen Chean Teh, Adrian Atanasiu, Ghajendran Poovanandran

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)

Recommendations

• ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
• Parikh matrices, amiability and Istrail morphism
• Morphisms on amiable words
• Parikh matrices and strong \(M\)-equivalence
• Order of weak \(M\)-relation and Parikh matrices
• MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
• A new operator over Parikh languages
• Strong \((2 \cdot t)\) and strong \((3 \cdot t)\) transformations for strong \(M\)-equivalence
• Separability of \(M\)-equivalent words by morphisms
• Subword occurrences, Parikh matrices and Lyndon images

Cites work

• scientific article; zbMATH DE number 1735821 (Why is no real title available?)
• A new operator over Parikh languages
• A sharpening of the Parikh mapping
• An introduction to the Heisenberg group and the sub-Riemannian isoperimetric problem
• BINARY AMIABLE WORDS
• Connections between subwords and certain matrix mappings
• Core words and Parikh matrices
• Criteria for the matrix equivalence of words
• Independence of certain quantities indicating subword occurrences
• Injectivity of the Parikh matrix mappings revisited
• MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
• ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
• On Context-Free Languages
• On a conjecture about Parikh matrices
• On core words and the Parikh matrix mapping
• Parikh matrices and Parikh rewriting systems
• Parikh matrices and amiable words
• Parikh matrices and strong \(M\)-equivalence
• Product of Parikh matrices and commutativity
• Separability of \(M\)-equivalent words by morphisms
• Some characterizations of Parikh matrix equivalent binary words
• Strong \((2 \cdot t)\) and strong \((3 \cdot t)\) transformations for strong \(M\)-equivalence
• Subword histories and Parikh matrices

Cited in

(13)

• Elementary matrix equivalence and core transformation graphs for Parikh matrices
• Parikh word representability of bipartite permutation graphs
• Injectivity of the Parikh matrix mappings revisited
• A new study of Parikh matrices restricted to terms
• Counting subwords in circular words and their Parikh matrices
• Order of weak \(M\)-relation and Parikh matrices
• Binary images, \(M\)-vectors, and ambiguity
• Erasure and error correcting ability of Parikh matrices
• \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited
• ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
• Parikh matrices for powers of words
• Strong \((2 \cdot t)\) and strong \((3 \cdot t)\) transformations for strong \(M\)-equivalence
• Freeness problem for matrix semigroups of Parikh matrices

This page was built for publication: On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1704577)