scientific article; zbMATH DE number 7783785

DOI10.14317/jami.2023.345MaRDI QIDQ6143443

K. Janaki, V. Rajkumar Dare, R. Arulprakasam

Publication date: 5 January 2024

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

subwordsParikh matrixpicture arrayParikh \(\mathtt{q}\)-matrixProuhet array morphism

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Discrete mathematics in relation to computer science (68R99)

Cites Work

• Lyndon factorization of the Prouhet words.
• Balance properties of multi-dimensional words
• Core words and Parikh matrices
• Separability of M-Equivalent Words by Morphisms
• TWO-DIMENSIONAL DIGITIZED PICTURE ARRAYS AND PARIKH MATRICES
• REPETITIONS, FULLNESS, AND UNIFORMITY IN TWO-DIMENSIONAL WORDS
• PARIKH MATRICES, AMIABILITY AND ISTRAIL MORPHISM
• A sharpening of the Parikh mapping
• Some Algebraic Aspects of Parikh q-Matrices
• On M-Equivalence and Strong M-Equivalence for Parikh Matrices
• On Commuting Parikh q-Matrices
• Parikh q-Matrices and q-Ambiguous Words
• On Context-Free Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: