Properties of Parikh matrices of binary words obtained by an extension of a restricted shuffle operator
From MaRDI portal
Publication:4640340
DOI10.1142/S0129054118500119zbMATH Open1385.68027OpenAlexW2800228209WikidataQ62046574 ScholiaQ62046574MaRDI QIDQ4640340FDOQ4640340
Authors: Somnath Bera, Kalpana Mahalingam, K. G. Subramanian 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Core words and Parikh matrices
- A sharpening of the Parikh mapping
- BINARY AMIABLE WORDS
- ON PARIKH MATRICES
- Title not available (Why is that?)
- Title not available (Why is that?)
- On core words and the Parikh matrix mapping
- On Context-Free Languages
- Some characterizations of Parikh matrix equivalent binary words
- Title not available (Why is that?)
- Product of Parikh matrices and commutativity
- A new operator over Parikh languages
Cited In (9)
- On exploring the topological aspects of the chemical structure of the nanotube \(HAC_5C_7[w,t]\)
- A new study of Parikh matrices restricted to terms
- Certain distance-based topological indices of Parikh word representable graphs
- Order of weak \(M\)-relation and Parikh matrices
- \(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited
- Wiener-type indices of Parikh word representable graphs
- Parikh matrices for powers of words
- A new operator over Parikh languages
- Strong \((2 \cdot t)\) and strong \((3 \cdot t)\) transformations for strong \(M\)-equivalence
This page was built for publication: Properties of Parikh matrices of binary words obtained by an extension of a restricted shuffle operator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4640340)
