ON PARIKH MATRICES
From MaRDI portal
Publication:3634179
DOI10.1142/S0129054109006528zbMath1178.68326OpenAlexW2150488146MaRDI QIDQ3634179
Ang Miin Huey, Atulya K. Nagar, K. G. Subramanian
Publication date: 23 June 2009
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054109006528
Related Items (14)
PRODUCT OF PARIKH MATRICES AND COMMUTATIVITY ⋮ Algebraic properties of Parikh matrices of binary picture arrays ⋮ Algebraic properties of Parikh \texttt{q}-matrices on two-dimensional words ⋮ Binary Images, M −Vectors, and Ambiguity ⋮ Properties of Parikh Matrices of Binary Words Obtained by an Extension of a Restricted Shuffle Operator ⋮ Criteria for the matrix equivalence of words ⋮ SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES ⋮ Certain distance-based topological indices of Parikh word representable graphs ⋮ Wiener-type indices of Parikh word representable graphs ⋮ Parikh matrices for powers of words ⋮ On Core Words and the Parikh Matrix Mapping ⋮ TWO-DIMENSIONAL DIGITIZED PICTURE ARRAYS AND PARIKH MATRICES ⋮ Core words and Parikh matrices ⋮ Binary image reconstruction based on prescribed numerical information
Cites Work
- Some characterizations of Parikh matrix equivalent binary words
- Connections between subwords and certain matrix mappings
- Independence of certain quantities indicating subword occurrences
- MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
- A sharpening of the Parikh mapping
- BINARY AMIABLE WORDS
- On Context-Free Languages
This page was built for publication: ON PARIKH MATRICES
