Rama Raghavan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Rama Raghavan has a total of 85 co-authors. Here are the top co-authors by number of shared publications:
- Kalpana Mahalingam
Indian Institute of Technology Madras
5 shared publications L. Jeganathan
Department of Mathematics , Indian Institute of Technology Madras , Chennai, India
4 shared publications- Ujjwal Kumar Mishra
Indian Institute of Technology Madras
4 shared publications - M. Rajavel Praveen
Indian Institute of Technology Madras
3 shared publications - Williams Sureshkumar
Department of Computer Science and Engineering Saveetha University Chennai-602105 India
3 shared publications - Marian Gheorghe
The University of Sheffield
2 shared publications
Latest Publications
- 14 February 2025
- Published by Springer Nature
- p. 13-23
The $\ell $-Rauzy Graphs for Scattered and Non-scattered Subwords of Generalized Rainbow Words- 14 February 2025
- Published by Springer Nature
- p. 13-23
The $\ell $-Rauzy Graphs for Scattered and Non-scattered Subwords of Generalized Rainbow Words- 1 December 2024
- Published by Pleiades Publishing Ltd in Journal of Applied and Industrial Mathematics
- Vol. 18 (4) , 824-838
The $ \ell $-Rauzy Graphs on Infinite WordsWord-representable graphs are vital in the Combinatorics of Words and Graph Theory. We define one such graph, the \( \ell \)-Rauzy graph, and study its structural properties for a few infinite words. The \( \ell \)-Rauzy graph of order \( k \) for an infinite word \( w \) is a directed graph in which each vertex is a subword of length \( k \) of \( w \), where any two vertices \( u,v \) form an arc \( uv \) iff the prefix of \( v \) of length \( \ell \) is the same as the suffix of \( u \) of length \( \ell \) and the concatenated word formed by the arc \( uv \) of length \( 2k-\ell \) is a subword of \( w \). As main results, we show that the \( \ell \)-Rauzy graph of order \( k \) for the infinite Fibonacci word \( f \) is strongly connected, and we explicitly find the graph structure of the \( \ell \)-Rauzy graph of order \( k \) for an infinite periodic word, by knowing the locations of subwords of \( f \) and infinite periodic words. As locating the subwords in an infinite word is not easy, we show that the \( \ell \)-Rauzy graph of order \( k \) for an Arnoux-Rauzy word is strongly connected using a different approach. \( \ell \)- 1 December 2024
- Published by Pleiades Publishing Ltd in Journal of Applied and Industrial Mathematics
- Vol. 18 (4) , 824-838
The $ \ell $-Rauzy Graphs on Infinite WordsWord-representable graphs are vital in the Combinatorics of Words and Graph Theory. We define one such graph, the \( \ell \)-Rauzy graph, and study its structural properties for a few infinite words. The \( \ell \)-Rauzy graph of order \( k \) for an infinite word \( w \) is a directed graph in which each vertex is a subword of length \( k \) of \( w \), where any two vertices \( u,v \) form an arc \( uv \) iff the prefix of \( v \) of length \( \ell \) is the same as the suffix of \( u \) of length \( \ell \) and the concatenated word formed by the arc \( uv \) of length \( 2k-\ell \) is a subword of \( w \). As main results, we show that the \( \ell \)-Rauzy graph of order \( k \) for the infinite Fibonacci word \( f \) is strongly connected, and we explicitly find the graph structure of the \( \ell \)-Rauzy graph of order \( k \) for an infinite periodic word, by knowing the locations of subwords of \( f \) and infinite periodic words. As locating the subwords in an infinite word is not easy, we show that the \( \ell \)-Rauzy graph of order \( k \) for an Arnoux-Rauzy word is strongly connected using a different approach. \( \ell \)- 11 May 2023
- Published by Elsevier in Advances in Applied Mathematics
- Vol. 149
Two-dimensional Fibonacci words: Tandem repeats and factor complexity
- 11 May 2023
- Published by Elsevier in Advances in Applied Mathematics
- Vol. 149
Two-dimensional Fibonacci words: Tandem repeats and factor complexity
- 3 February 2023
- Published by Springer Nature
- p. 139-149
Note on Distributivity of Different String Operations Over Language Sets
- 3 February 2023
- Published by Springer Nature
- p. 139-149
Note on Distributivity of Different String Operations Over Language Sets
- Open Access
A Note On $\ell$-Rauzy Graphs for the Infinite Fibonacci Word
The $\ell$-Rauzy graph of order $k$ for any infinite word is a directed graph in which an arc $(v_1,v_2)$ is formed if the concatenation of the word $v_1$ and the suffix of $v_2$ of length $k-\ell$ is a subword of the infinite word. In this paper, we consider one of the important aperiodic recurrent words, the infinite Fibonacci word for discussion. We prove a few basic properties of the $\ell$-Rauzy graph of the infinite Fibonacci word. We also prove that the $\ell$-Rauzy graphs for the infinite Fibonacci word are strongly connected.Open AccessA Note On $\ell$-Rauzy Graphs for the Infinite Fibonacci Word
The $\ell$-Rauzy graph of order $k$ for any infinite word is a directed graph in which an arc $(v_1,v_2)$ is formed if the concatenation of the word $v_1$ and the suffix of $v_2$ of length $k-\ell$ is a subword of the infinite word. In this paper, we consider one of the important aperiodic recurrent words, the infinite Fibonacci word for discussion. We prove a few basic properties of the $\ell$-Rauzy graph of the infinite Fibonacci word. We also prove that the $\ell$-Rauzy graphs for the infinite Fibonacci word are strongly connected. - Open Access
Two-dimensional Fibonacci Words: Tandem Repeats and Factor Complexity
If $x$ is a non-empty string then the repetition $xx$ is called a tandem repeat. Similarly, a tandem in a two dimensional array $X$ is a configuration consisting of a same primitive block $W$ that touch each other with one side or corner. In \cite{Apostolico:2000}, Apostolico and Brimkov have proved various bounds for the number of tandems in a two dimensional word of size $m \times n$. Of the two types of tandems considered therein, they also proved that, for one type, the number of occurrences in an $m \times n$ Fibonacci array attained the general upper bound, $\mathcal{O}(m^{2}n \hspace{0.1cm} \mbox{log} \hspace{0.1cm} n)$. In this paper, we derive an expression for the exact number of tandems in a given finite Fibonacci array $f_{m,n}$. As a required result, we derive the factor complexities of $f_{m,n}$, $m,n \ge 0$ and that of the infinite Fibonacci word $f_{\infty, \infty}$. Generations of $f_{\infty, \infty}$ and $f_{m,n}$, for any given $m,n \ge 1$ using a two-dimensional homomorphism is also achieved.Open AccessTwo-dimensional Fibonacci Words: Tandem Repeats and Factor Complexity
If $x$ is a non-empty string then the repetition $xx$ is called a tandem repeat. Similarly, a tandem in a two dimensional array $X$ is a configuration consisting of a same primitive block $W$ that touch each other with one side or corner. In \cite{Apostolico:2000}, Apostolico and Brimkov have proved various bounds for the number of tandems in a two dimensional word of size $m \times n$. Of the two types of tandems considered therein, they also proved that, for one type, the number of occurrences in an $m \times n$ Fibonacci array attained the general upper bound, $\mathcal{O}(m^{2}n \hspace{0.1cm} \mbox{log} \hspace{0.1cm} n)$. In this paper, we derive an expression for the exact number of tandems in a given finite Fibonacci array $f_{m,n}$. As a required result, we derive the factor complexities of $f_{m,n}$, $m,n \ge 0$ and that of the infinite Fibonacci word $f_{\infty, \infty}$. Generations of $f_{\infty, \infty}$ and $f_{m,n}$, for any given $m,n \ge 1$ using a two-dimensional homomorphism is also achieved. - 16 November 2020
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 31 (07) , 891-913
Watson–Crick Jumping Finite Automata
Watson–Crick jumping finite automata work on tapes which are double stranded sequences of symbols similar to that of Watson–Crick automata. The double stranded sequence is scanned in a discontinuous manner. That is, after reading a double stranded string, the automata can jump over some subsequence and continue scanning depending on the rule. Some variants of such automata are 1-limited, No state, All final and Simple Watson–Crick jumping finite automata. The comparison of the languages accepted by these variants with the language classes in Chomsky hierarchy has been carried out. We investigate some closure properties. We also try to place the duplication closure of a word in Watson–Crick jumping finite automata family. We have discussed the closure property of Watson–Crick jumping finite automata family under duplication operations.
- 16 November 2020
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 31 (07) , 891-913
Watson–Crick Jumping Finite Automata
Watson–Crick jumping finite automata work on tapes which are double stranded sequences of symbols similar to that of Watson–Crick automata. The double stranded sequence is scanned in a discontinuous manner. That is, after reading a double stranded string, the automata can jump over some subsequence and continue scanning depending on the rule. Some variants of such automata are 1-limited, No state, All final and Simple Watson–Crick jumping finite automata. The comparison of the languages accepted by these variants with the language classes in Chomsky hierarchy has been carried out. We investigate some closure properties. We also try to place the duplication closure of a word in Watson–Crick jumping finite automata family. We have discussed the closure property of Watson–Crick jumping finite automata family under duplication operations.
- Open Access
Label Languages of 8-directional Array P System
An 8-directional array P system is one where the rewriting of an array can happen in any 8-directions. The array rules of such a system are labelled thus resulting in a labelled 8-directional array P system. The labelling is not unique and the label language is obtained by recording the strings over the labels used in any terminating derivation of the P system. The system is shown to generate interesting pictures. The label language is compared with Chomsky hierarchy.
Open AccessLabel Languages of 8-directional Array P System
An 8-directional array P system is one where the rewriting of an array can happen in any 8-directions. The array rules of such a system are labelled thus resulting in a labelled 8-directional array P system. The labelling is not unique and the label language is obtained by recording the strings over the labels used in any terminating derivation of the P system. The system is shown to generate interesting pictures. The label language is compared with Chomsky hierarchy.
- Open Access
- 22 July 2016
- Published by Springer Nature in Trials
- Vol. 17 (1) , 1-8
Bayesian accrual prediction for interim review of clinical studies: open source R package and smartphone application
Subject recruitment for medical research is challenging. Slow patient accrual leads to increased costs and delays in treatment advances. Researchers need reliable tools to manage and predict the accrual rate. The previously developed Bayesian method integrates researchers’ experience on former trials and data from an ongoing study, providing a reliable prediction of accrual rate for clinical studies. In this paper, we present a user-friendly graphical user interface program developed in R. A closed-form solution for the total subjects that can be recruited within a fixed time is derived. We also present a built-in Android system using Java for web browsers and mobile devices. Using the accrual software, we re-evaluated the Veteran Affairs Cooperative Studies Program 558— ROBOTICS study. The application of the software in monitoring and management of recruitment is illustrated for different stages of the trial. This developed accrual software provides a more convenient platform for estimation and prediction of the accrual process.
- 22 July 2016
- Published by Springer Nature in Trials
- Vol. 17 (1) , 1-8
Open AccessBayesian accrual prediction for interim review of clinical studies: open source R package and smartphone application
Subject recruitment for medical research is challenging. Slow patient accrual leads to increased costs and delays in treatment advances. Researchers need reliable tools to manage and predict the accrual rate. The previously developed Bayesian method integrates researchers’ experience on former trials and data from an ongoing study, providing a reliable prediction of accrual rate for clinical studies. In this paper, we present a user-friendly graphical user interface program developed in R. A closed-form solution for the total subjects that can be recruited within a fixed time is derived. We also present a built-in Android system using Java for web browsers and mobile devices. Using the accrual software, we re-evaluated the Veteran Affairs Cooperative Studies Program 558— ROBOTICS study. The application of the software in monitoring and management of recruitment is illustrated for different stages of the trial. This developed accrual software provides a more convenient platform for estimation and prediction of the accrual process.