Ghajendran Poovanandran

Orcid: 0000-0003-0808-0028

According to our database1, Ghajendran Poovanandran authored at least 9 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Counting subwords in circular words and their Parikh matrices.
Theor. Comput. Sci., February, 2024

2022
Erasure and error correcting ability of Parikh matrices.
Inf. Process. Lett., 2022

2019
Strong (2 ⋅ t) and Strong (3 ⋅ t) Transformations for Strong M-Equivalence.
Int. J. Found. Comput. Sci., 2019

Parikh matrices for powers of words.
Acta Informatica, 2019

Parikh Determinants.
Proceedings of the Combinatorics on Words - 12th International Conference, 2019

2018
On strongly <i>M</i>-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices.
Theor. Comput. Sci., 2018

On M-Equivalence and Strong M-Equivalence for Parikh Matrices.
Int. J. Found. Comput. Sci., 2018

Elementary matrix equivalence and core transformation graphs for Parikh matrices.
Discret. Appl. Math., 2018

Parikh Motivated Study on Repetitions in Words.
CoRR, 2018


  Loading...