A sharpening of the Parikh mapping
RAIRO-Theor. Inf. Appl., 35 6 (2001) 551-564
Published online: 2002-07-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
On some 2-binomial coefficients of binary words: geometrical interpretation, partitions of integers, and fair words
Gwenaël RichommeTheoretical Computer Science 1066 115732 (2026)
https://doi.org/10.1016/j.tcs.2025.115732
Characterizations of M-Equivalence and Weak M-Relation
Joonghyuk Hahn, Hyunjoon Cheon and Yo-Sub HanInternational Journal of Foundations of Computer Science 37 (01) 73 (2026)
https://doi.org/10.1142/S0129054125410047
(2025)
https://doi.org/10.2139/ssrn.5211667
480 255 (2025)
https://doi.org/10.1007/978-3-031-77764-6_30
Ternary is still good for Parikh matrices
Robert Mercaş and Wen Chean TehTheoretical Computer Science 1055 115489 (2025)
https://doi.org/10.1016/j.tcs.2025.115489
15373 164 (2025)
https://doi.org/10.1007/978-3-031-77019-7_10
Quantifying topological indices in bipartite and tripartite graphs using Lyndon words and Python algorithms
A. Sethukkarasi, S. Vidyanandini and R. ArulprakasamInternational Journal of Information Technology 17 (2) 1247 (2025)
https://doi.org/10.1007/s41870-024-02303-0
q-Parikh matrices and q-deformed binomial coefficients of words
Antoine Renard, Michel Rigo and Markus A. WhitelandDiscrete Mathematics 348 (5) 114381 (2025)
https://doi.org/10.1016/j.disc.2024.114381
14791 68 (2024)
https://doi.org/10.1007/978-3-031-66159-4_6
Counting subwords in circular words and their Parikh matrices
Ghajendran Poovanandran, Jamie Simpson and Wen Chean TehTheoretical Computer Science 985 114344 (2024)
https://doi.org/10.1016/j.tcs.2023.114344
Combinatorial Image Analysis
K. Janaki, R. Arulprakasam, Meenakshi Paramasivan and V. Rajkumar DareLecture Notes in Computer Science, Combinatorial Image Analysis 13348 171 (2023)
https://doi.org/10.1007/978-3-031-23612-9_11
14151 141 (2023)
https://doi.org/10.1007/978-3-031-40247-0_10
14151 166 (2023)
https://doi.org/10.1007/978-3-031-40247-0_12
2529 020024 (2022)
https://doi.org/10.1063/5.0104257
Implementation and Application of Automata
Laura K. Hutchinson, Robert Mercaş and Daniel ReidenbachLecture Notes in Computer Science, Implementation and Application of Automata 13266 116 (2022)
https://doi.org/10.1007/978-3-031-07469-1_9
Erasure and error correcting ability of Parikh matrices
Adrian Atanasiu, Ghajendran Poovanandran, Abdalhadi Abu Zeyneh and Wen Chean TehInformation Processing Letters 175 106223 (2022)
https://doi.org/10.1016/j.ipl.2021.106223
Generalized mapping for multiset rewriting systems
Athar Kharal, Mansoor H. Alshehri, Nasser Bin Turki and Faisal Z. DuraihemSoft Computing 25 (17) 11439 (2021)
https://doi.org/10.1007/s00500-021-06029-0
The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs
Hongbo Hua and Maolin WangBulletin of the Malaysian Mathematical Sciences Society 44 (6) 3689 (2021)
https://doi.org/10.1007/s40840-021-01140-9
2D Words and Generalized Parikh Matrices
K. Janaki, R. Arulprakasam and V. R. DareJournal of Physics: Conference Series 1850 (1) 012004 (2021)
https://doi.org/10.1088/1742-6596/1850/1/012004
1 (2021)
https://doi.org/10.1109/ICITIIT51526.2021.9399604
Reducing the ambiguity of Parikh matrices
Jeffery Dick, Laura K. Hutchinson, Robert Mercaş and Daniel ReidenbachTheoretical Computer Science 860 23 (2021)
https://doi.org/10.1016/j.tcs.2021.01.025
Certain Distance-Based Topological Indices of Parikh Word Representable Graphs
Nobin Thomas, Lisa Mathew, Sastha Sriram, et al.Journal of Mathematics 2021 1 (2021)
https://doi.org/10.1155/2021/5567663
Developments in Language Theory
Nobin Thomas, Lisa Mathew, Somnath Bera, Atulya K. Nagar and K. G. SubramanianLecture Notes in Computer Science, Developments in Language Theory 12811 368 (2021)
https://doi.org/10.1007/978-3-030-81508-0_30
Parikh word representability of bipartite permutation graphs
Wen Chean Teh, Zhen Chuan Ng, Muhammad Javaid and Zi Jing ChernDiscrete Applied Mathematics 282 208 (2020)
https://doi.org/10.1016/j.dam.2019.12.005
A compactness property of the k-abelian monoids
Juhani Karhumäki and Markus A. WhitelandTheoretical Computer Science 834 3 (2020)
https://doi.org/10.1016/j.tcs.2020.01.023
M-ambiguity Sequences for Parikh Matrices and Their Periodicity Revisited
Ghajendran Poovanandran and Wen Chean TehBulletin of the Malaysian Mathematical Sciences Society 43 (4) 3305 (2020)
https://doi.org/10.1007/s40840-019-00867-w
The binomial equivalence classes of finite words
Marie Lejeune, Michel Rigo and Matthieu RosenfeldInternational Journal of Algebra and Computation 30 (07) 1375 (2020)
https://doi.org/10.1142/S0218196720500459
Parikh q-Matrices and q-Ambiguous Words
Somnath Bera, Rodica Ceterchi, Kalpana Mahalingam and K. G. SubramanianInternational Journal of Foundations of Computer Science 31 (01) 23 (2020)
https://doi.org/10.1142/S012905412040002X
A New Study of Parikh Matrices Restricted to Terms
Zi Jing Chern, K. G. Subramanian, Azhana Ahmad and Wen Chean TehInternational Journal of Foundations of Computer Science 31 (05) 621 (2020)
https://doi.org/10.1142/S0129054120500306
Algebraic Properties of Parikh Matrices of Binary Picture Arrays
Somnath Bera, Sastha Sriram, Atulya K. Nagar, Linqiang Pan and K. G. SubramanianJournal of Mathematics 2020 1 (2020)
https://doi.org/10.1155/2020/3236405
Developments in Language Theory
Ryoma Sin’YaLecture Notes in Computer Science, Developments in Language Theory 12086 304 (2020)
https://doi.org/10.1007/978-3-030-48516-0_23
Some results on Parikh word representable graphs and partitions
Lisa Mathew, Nobin Thomas, Somnath Bera and K.G. SubramanianAdvances in Applied Mathematics 107 102 (2019)
https://doi.org/10.1016/j.aam.2019.02.009
11682 68 (2019)
https://doi.org/10.1007/978-3-030-28796-2_5
Parikh matrices for powers of words
Adrian Atanasiu, Ghajendran Poovanandran and Wen Chean TehActa Informatica 56 (6) 521 (2019)
https://doi.org/10.1007/s00236-018-0327-8
Strong (2 ⋅ t) and Strong (3 ⋅ t) Transformations for Strong M-Equivalence
Ghajendran Poovanandran and Wen Chean TehInternational Journal of Foundations of Computer Science 30 (05) 719 (2019)
https://doi.org/10.1142/S0129054119500187
Order of weak M-relation and Parikh matrices
Wen Chean Teh, K.G. Subramanian and Somnath BeraTheoretical Computer Science 743 83 (2018)
https://doi.org/10.1016/j.tcs.2018.04.042
Parikh matrices and M-ambiguity sequence
Ghajendran Poovanandran and Wen Chean TehJournal of Physics: Conference Series 1132 012012 (2018)
https://doi.org/10.1088/1742-6596/1132/1/012012
On strongly M-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
Wen Chean Teh, Adrian Atanasiu and Ghajendran PoovanandranTheoretical Computer Science 719 86 (2018)
https://doi.org/10.1016/j.tcs.2017.11.016
On M-Equivalence and Strong M-Equivalence for Parikh Matrices
Ghajendran Poovanandran and Wen Chean TehInternational Journal of Foundations of Computer Science 29 (01) 123 (2018)
https://doi.org/10.1142/S0129054118500065
Two-dimensional picture arrays and Parikh q—matrices
Somnath Bera, Kalpana Mahalingam, Linqiang Pan and K. G. SubramanianJournal of Physics: Conference Series 1132 012006 (2018)
https://doi.org/10.1088/1742-6596/1132/1/012006
Properties of Parikh Matrices of Binary Words Obtained by an Extension of a Restricted Shuffle Operator
Somnath Bera, Kalpana Mahalingam and K. G. SubramanianInternational Journal of Foundations of Computer Science 29 (03) 403 (2018)
https://doi.org/10.1142/S0129054118500119
Elementary matrix equivalence and core transformation graphs for Parikh matrices
Ghajendran Poovanandran and Wen Chean TehDiscrete Applied Mathematics 251 276 (2018)
https://doi.org/10.1016/j.dam.2018.06.002
Parikh matrices of arrays under Dejean array morphism
Ibrahim Venkat, Sastha Sriram, Atulya K. Nagar and K.G. SubramanianJournal of Physics: Conference Series 1132 012003 (2018)
https://doi.org/10.1088/1742-6596/1132/1/012003
11011 100 (2018)
https://doi.org/10.1007/978-3-319-98355-4_7
Relations on words
Michel RigoIndagationes Mathematicae 28 (1) 183 (2017)
https://doi.org/10.1016/j.indag.2016.11.018
A New Operator over Parikh Languages
Adrian Atanasiu and Wen Chean TehInternational Journal of Foundations of Computer Science 27 (06) 757 (2016)
https://doi.org/10.1142/S0129054116500271
Structural Properties of Word Representable Graphs
Somnath Bera and Kalpana MahalingamMathematics in Computer Science 10 (2) 209 (2016)
https://doi.org/10.1007/s11786-016-0257-1
Parikh Matrices and Strong M-Equivalence
Wen Chean TehInternational Journal of Foundations of Computer Science 27 (05) 545 (2016)
https://doi.org/10.1142/S0129054116500155
Some Algebraic Aspects of Parikh q-Matrices
Somnath Bera and Kalpana MahalingamInternational Journal of Foundations of Computer Science 27 (04) 479 (2016)
https://doi.org/10.1142/S0129054116500118
Separability of M-Equivalent Words by Morphisms
Wen Chean TehInternational Journal of Foundations of Computer Science 27 (01) 39 (2016)
https://doi.org/10.1142/S0129054116500039
On a conjecture about Parikh matrices
Wen Chean Teh and Adrian AtanasiuTheoretical Computer Science 628 30 (2016)
https://doi.org/10.1016/j.tcs.2016.03.008
On Core Words and the Parikh Matrix Mapping
Wen Chean TehInternational Journal of Foundations of Computer Science 26 (01) 123 (2015)
https://doi.org/10.1142/S0129054115500069
Core words and Parikh matrices
Wen Chean Teh and Kiam Heong KwaTheoretical Computer Science 582 60 (2015)
https://doi.org/10.1016/j.tcs.2015.03.037
On Core Words and the Parikh Matrix Mapping
Wen Chean TehInternational Journal of Foundations of Computer Science 26 (01) 123 (2015)
https://doi.org/10.1142/s0129054115500069
Another generalization of abelian equivalence: Binomial complexity of infinite words
M. Rigo and P. SalimovTheoretical Computer Science 601 47 (2015)
https://doi.org/10.1016/j.tcs.2015.07.025
Proceedings of Fourth International Conference on Soft Computing for Problem Solving
Amrita Bhattacharjee and Bipul Syam PurkayasthaAdvances in Intelligent Systems and Computing, Proceedings of Fourth International Conference on Soft Computing for Problem Solving 335 135 (2015)
https://doi.org/10.1007/978-81-322-2217-0_12
Binary image reconstruction based on prescribed numerical information
K. G. Subramanian, Pradeep Isawasan, Rahmat Budiarto and Ibrahim VenkatActa Mathematicae Applicatae Sinica, English Series 31 (2) 519 (2015)
https://doi.org/10.1007/s10255-015-0482-4
Proceedings of the Third International Conference on Soft Computing for Problem Solving
Amrita Bhattacharjee and Bipul Syam PurkayasthaAdvances in Intelligent Systems and Computing, Proceedings of the Third International Conference on Soft Computing for Problem Solving 258 857 (2014)
https://doi.org/10.1007/978-81-322-1771-8_74
Enriching Parikh matrix mappings
Adrian Atanasiu and Radu-Florian AtanasiuInternational Journal of Computer Mathematics 90 (3) 511 (2013)
https://doi.org/10.1080/00207160.2012.742243
Several extensions of the Parikh matrix L -morphism
Hamed M.K. Alazemi and Anton ČernýJournal of Computer and System Sciences 79 (5) 658 (2013)
https://doi.org/10.1016/j.jcss.2013.01.018
TWO-DIMENSIONAL DIGITIZED PICTURE ARRAYS AND PARIKH MATRICES
K. G. SUBRAMANIAN, KALPANA MAHALINGAM, ROSNI ABDULLAH and ATULYA K. NAGARInternational Journal of Foundations of Computer Science 24 (03) 393 (2013)
https://doi.org/10.1142/S012905411350010X
PRODUCT OF PARIKH MATRICES AND COMMUTATIVITY
KALPANA MAHALINGAM and K. G. SUBRAMANIANInternational Journal of Foundations of Computer Science 23 (01) 207 (2012)
https://doi.org/10.1142/S0129054112500049
Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism
Arto SalomaaTheoretical Computer Science 432 85 (2012)
https://doi.org/10.1016/j.tcs.2012.01.017
POWER SUMS ASSOCIATED WITH CERTAIN RECURSIVE PROCEDURES ON WORDS
ARTO SALOMAAInternational Journal of Foundations of Computer Science 22 (01) 261 (2011)
https://doi.org/10.1142/S0129054111008003
Combinatorial Image Analysis
K. G. Subramanian, Kalpana Mahalingam, Rosni Abdullah and Atulya K. NagarLecture Notes in Computer Science, Combinatorial Image Analysis 6636 248 (2011)
https://doi.org/10.1007/978-3-642-21073-0_23
COUNTING SUBWORDS USING A TRIE AUTOMATON
HAMED M. K. ALAZEMI and ANTON ČERNÝInternational Journal of Foundations of Computer Science 22 (06) 1457 (2011)
https://doi.org/10.1142/S0129054111008817
Generalizations of Parikh mappings
Anton ČernýRAIRO - Theoretical Informatics and Applications 44 (2) 209 (2010)
https://doi.org/10.1051/ita/2009021
PARIKH MATRICES, AMIABILITY AND ISTRAIL MORPHISM
ADRIAN ATANASIUInternational Journal of Foundations of Computer Science 21 (06) 1021 (2010)
https://doi.org/10.1142/S0129054110007702
PARIKH MATRIX MAPPING AND LANGUAGES
RADU-FLORIAN ATANASIUInternational Journal of Foundations of Computer Science 21 (06) 993 (2010)
https://doi.org/10.1142/S0129054110007684
SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES
ARTO SALOMAA and SHENG YUInternational Journal of Foundations of Computer Science 21 (01) 91 (2010)
https://doi.org/10.1142/S0129054110007155
Subword balance, position indices and power sums
Arto SalomaaJournal of Computer and System Sciences 76 (8) 861 (2010)
https://doi.org/10.1016/j.jcss.2010.04.012
Criteria for the matrix equivalence of words
Arto SalomaaTheoretical Computer Science 411 (16-18) 1818 (2010)
https://doi.org/10.1016/j.tcs.2010.01.036
ON PARIKH MATRICES
K. G. SUBRAMANIAN, ANG MIIN HUEY and ATULYA K. NAGARInternational Journal of Foundations of Computer Science 20 (02) 211 (2009)
https://doi.org/10.1142/S0129054109006528
Parikh matrices and amiable words
Adrian Atanasiu, Radu Atanasiu and Ion PetreTheoretical Computer Science 390 (1) 102 (2008)
https://doi.org/10.1016/j.tcs.2007.10.022
Subword histories and associated matrices
Arto SalomaaTheoretical Computer Science 407 (1-3) 250 (2008)
https://doi.org/10.1016/j.tcs.2008.05.023
Advances in Visual Computing
V. Masilamani, Kamala Krithivasan, K. G. Subramanian and Ang Miin HueyLecture Notes in Computer Science, Advances in Visual Computing 5359 1137 (2008)
https://doi.org/10.1007/978-3-540-89646-3_113
COMPARING SUBWORD OCCURRENCES IN BINARY D0L SEQUENCES
ARTO SALOMAAInternational Journal of Foundations of Computer Science 18 (06) 1395 (2007)
https://doi.org/10.1142/S0129054107005431
BINARY AMIABLE WORDS
ADRIAN ATANASIUInternational Journal of Foundations of Computer Science 18 (02) 387 (2007)
https://doi.org/10.1142/S0129054107004735
Independence of certain quantities indicating subword occurrences
Arto SalomaaTheoretical Computer Science 362 (1-3) 222 (2006)
https://doi.org/10.1016/j.tcs.2006.06.025
Subword conditions and subword histories
Arto Salomaa and Sheng YuInformation and Computation 204 (12) 1741 (2006)
https://doi.org/10.1016/j.ic.2006.09.003
Connections between subwords and certain matrix mappings
Arto SalomaaTheoretical Computer Science 340 (2) 188 (2005)
https://doi.org/10.1016/j.tcs.2005.03.024
Subword histories and Parikh matrices
Alexandru Mateescu, Arto Salomaa and Sheng YuJournal of Computer and System Sciences 68 (1) 1 (2004)
https://doi.org/10.1016/j.jcss.2003.04.001
Some characterizations of Parikh matrix equivalent binary words
S. Fossé and G. RichommeInformation Processing Letters 92 (2) 77 (2004)
https://doi.org/10.1016/j.ipl.2004.06.011
Theory Is Forever
Alexandru MateescuLecture Notes in Computer Science, Theory Is Forever 3113 170 (2004)
https://doi.org/10.1007/978-3-540-27812-2_16
Exploring New Frontiers of Theoretical Informatics
Omer Egecioglu and Oscar H. IbarraIFIP International Federation for Information Processing, Exploring New Frontiers of Theoretical Informatics 155 125 (2004)
https://doi.org/10.1007/1-4020-8141-3_12
MATRIX INDICATORS FOR SUBWORD OCCURRENCES AND AMBIGUITY
ALEXANDRU MATEESCU and ARTO SALOMAAInternational Journal of Foundations of Computer Science 15 (02) 277 (2004)
https://doi.org/10.1142/S0129054104002418
Extending Parikh matrices
Traian-Florin ŞerbănuţăTheoretical Computer Science 310 (1-3) 233 (2004)
https://doi.org/10.1016/S0304-3975(03)00396-7