Properties of Parikh Matrices of Binary Words Obtained by an Extension of a Restricted Shuffle Operator

DOI10.1142/S0129054118500119zbMath1385.68027OpenAlexW2800228209WikidataQ62046574 ScholiaQ62046574MaRDI QIDQ4640340

Somnath Bera, K. G. Subramanian, Kalpana Mahalingam

Publication date: 17 May 2018

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

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

zbMATH Keywords

ambiguitycombinatorics on wordsParikh matrixsshuffle operator

Mathematics Subject Classification ID

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

Related Items (7)

Order of weak \(M\)-relation and Parikh matrices ⋮ \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited ⋮ Strong (2 ⋅ t) and Strong (3 ⋅ t) Transformations for Strong M-Equivalence ⋮ Certain distance-based topological indices of Parikh word representable graphs ⋮ Wiener-type indices of Parikh word representable graphs ⋮ Parikh matrices for powers of words ⋮ A New Study of Parikh Matrices Restricted to Terms

Cites Work

• Some characterizations of Parikh matrix equivalent binary words
• Core words and Parikh matrices
• PRODUCT OF PARIKH MATRICES AND COMMUTATIVITY
• A sharpening of the Parikh mapping
• BINARY AMIABLE WORDS
• ON PARIKH MATRICES
• On Core Words and the Parikh Matrix Mapping
• A New Operator over Parikh Languages
• On Context-Free Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Properties of Parikh Matrices of Binary Words Obtained by an Extension of a Restricted Shuffle Operator