PRODUCT OF PARIKH MATRICES AND COMMUTATIVITY

DOI10.1142/S0129054112500049zbMath1254.68194WikidataQ62046592 ScholiaQ62046592MaRDI QIDQ2909192

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

ambiguity; commuting words; Parikh matrix morphism

Mathematics Subject Classification ID

68R15: Combinatorics on words

68Q45: Formal languages and automata

Related Items

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, Unnamed Item, 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, Order of weak \(M\)-relation and Parikh matrices, On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices, A toolkit for Parikh matrices, TWO-DIMENSIONAL DIGITIZED PICTURE ARRAYS AND PARIKH MATRICES

Cites Work

• Unnamed Item
• Some characterizations of Parikh matrix equivalent binary words
• Criteria for the matrix equivalence of words
• Subword histories and Parikh matrices
• Extending Parikh matrices
• Parikh matrices and amiable words
• MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
• PARIKH MATRIX MAPPING AND LANGUAGES
• A sharpening of the Parikh mapping
• BINARY AMIABLE WORDS
• ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
• ON PARIKH MATRICES
• SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES