Algebraic properties of Parikh \texttt{q}-matrices on two-dimensional words
From MaRDI portal
Publication:6166838
DOI10.1007/978-3-031-23612-9_11zbMath1528.68187OpenAlexW4313445181MaRDI QIDQ6166838
Meenakshi Paramasivan, K. Janaki, R. Arulprakasam, V. Rajkumar Dare
Publication date: 3 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-23612-9_11
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Balance properties of multi-dimensional words
- Extending Parikh matrices
- Core words and Parikh matrices
- Parikh matrices and amiable words
- Parikh Matrices and Strong M-Equivalence
- TWO-DIMENSIONAL DIGITIZED PICTURE ARRAYS AND PARIKH MATRICES
- REPETITIONS, FULLNESS, AND UNIFORMITY IN TWO-DIMENSIONAL WORDS
- A sharpening of the Parikh mapping
- Some Algebraic Aspects of Parikh q-Matrices
- BINARY AMIABLE WORDS
- ON PARIKH MATRICES
- On M-Equivalence and Strong M-Equivalence for Parikh Matrices
- On Commuting Parikh q-Matrices
- Strong (2 ⋅ t) and Strong (3 ⋅ t) Transformations for Strong M-Equivalence
- Parikh q-Matrices and q-Ambiguous Words
- On Core Words and the Parikh Matrix Mapping
- On Context-Free Languages
- Theory Is Forever
- Parikh Matrices: Subword Indicators and Degrees of Ambiguity
This page was built for publication: Algebraic properties of Parikh \texttt{q}-matrices on two-dimensional words