Product of Parikh matrices and commutativity

DOI10.1142/S0129054112500049MaRDI QIDQ2909192zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Kalpana Mahalingam, K. G. Subramanian

Publication date 30 August 2012

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

Full work available at URL https://doi.org/10.1142/s0129054112500049

zbMATH Keywords

ambiguitycommuting wordsParikh matrix morphism

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• On commuting Parikh \(q\)-matrices
• Extending Parikh matrices
• ON PARIKH MATRICES
• Parikh determinants
• Parikh matrices for powers of words

Cites work

• A sharpening of the Parikh mapping
• BINARY AMIABLE WORDS
• Criteria for the matrix equivalence of words
• Extending Parikh matrices
• scientific article; zbMATH DE number 107464 (Why is no real title available?)
• MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
• ON PARIKH MATRICES
• ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
• Parikh matrices and amiable words
• PARIKH MATRIX MAPPING AND LANGUAGES
• Some characterizations of Parikh matrix equivalent binary words
• Subword histories and Parikh matrices
• Subword occurrences, Parikh matrices and Lyndon images

Cited in

(22)

• Matrix valued paraproducts
• Order of weak \(M\)-relation and Parikh matrices
• On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
• Extending Parikh matrices
• A toolkit for Parikh matrices
• \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited
• Parikh matrices for powers of words
• Parikh determinants
• Some new connections between matrix products for partitioned and non-partitioned matrices
• Two-dimensional digitized picture arrays and Parikh matrices
• BINARY AMIABLE WORDS
• ON PARIKH MATRICES
• 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-friendly permutations and uniformly Parikh-friendly words
• On commuting Parikh \(q\)-matrices
• Freeness problem for matrix semigroups of Parikh matrices
• A new operator over Parikh languages
• Reducing the ambiguity of Parikh matrices
• Counting subwords in circular words and their Parikh matrices
• Characterizations of M-equivalence and weak M-relation
• Ternary is still good for Parikh matrices

This page was built for publication: Product of Parikh matrices and commutativity

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