Lisa Mathew
@amaljyothi.ac.in
Scopus Publications
- Sufficiency Conditions for Well-Formedness of Quantum Context-Free Grammars
Merina Aruja, Lisa Mathew, Jayakrishna Vijayakumar
International Journal of Foundations of Computer Science, 2026
Natural computing refers to computing inspired by nature. This includes research areas such as membrane computing, DNA computing [7, 10, 12] and quantum computing. These models of computing especially quantum computing have been of interest recently. Moore and Crutchfield [9], in the year 2000 introduced the concept of quantum grammars wherein a notion of amplitude of a word derived from an initial nonterminal and associated probability of the word are defined. This quantum version is interesting in the sense that several classical results related to grammars have analogs in the quantum case. In particular, these authors show that there are quantum context-free languages that are not context-free. But the final probability of the derived word in a quantum context-free grammar is not studied by these authors. In this paper we begin investigating the probability associated with the derived word, especially in a quantum context-free grammar. We introduce suitable conditions on these grammars in order to ensure that the derived word does not have associated probability exceeding one. We call the language generated by these quantum grammars with this probability requirement as a well-formed language. Moreover we discuss the conversion of a general well-formed quantum context-free grammar satisfying these conditions to the corresponding Chomsky and Greibach normal forms. - Trace languages generated by target-indicated spiking neural P systems with mute rules
Jincy Sebastian, Lisa Mathew
International Journal of Parallel Emergent and Distributed Systems, 2026 - NC-ENCE Graph Grammars: Properties and Application to Game Design
Jayakrishna Vijayakumar, Lisa Mathew
International Journal of Foundations of Computer Science, 2025
Graph grammars form an interesting area of research due to their versatility in modelling diverse situations with graphs as the structures which are to be manipulated. A new class of graph grammars, NC-ENCE graph grammars has been introduced recently with an aim of restricting the order of application of graph production rules, thereby generating different graph classes using the same set of rules. In the study of automata and grammars, closure properties of the associated languages have been studied extensively. In particular, closure properties of various types of graph grammars have been examined in (Rozenberg and Welzl, Inf. and Control, 1986) and (Rozenberg and Welzl, Acta Informatica, 1986). In this paper, we modify the structure of NC-ENCE graph grammars with the aim of generating directed graphs. We then examine some critical closure properties of the NC-ENCE graph grammars discussed in (Jayakrishna and Mathew, Symmetry 2023) and (Jayakrishna and Mathew, Springer Nature 2025). On the other hand 2D game design using an algorithmic approach known as procedural content generation has been of interest recently. We show that employing these graph grammars simplifies the design of 2D games. We have also developed an algorithm which makes use of these graph grammars for generating random game level layouts ensuring that the players will get a different gaming experience each time they play. - Control Languages Associated with Labelled Spiking Neural P Systems with Mute Rules
Jincy Sebastian, Lisa Mathew
International Journal of Foundations of Computer Science, 2025
This paper introduces labelled spiking neural P systems with mute rules (LSNP-MR systems), combining existing mute rules with a labelling mechanism for rules. We investigate these systems both as language generators and acceptors, proving that LSNP-MR systems can generate languages beyond the context-free class and recognize context-sensitive languages. Our results demonstrate that the synergy between labelling and mute rules extends the computational power of spiking neural P systems while maintaining biological plausibility. - On Jumping Graph Grammars
Jayakrishna Vijayakumar, Lisa Mathew, Juby Mathew
Springer Proceedings in Mathematics and Statistics, 2025 - A New Class of Graph Grammars and Modelling of Certain Biological Structures
Jayakrishna Vijayakumar, Lisa Mathew, Atulya K. Nagar
Symmetry, 2023
Graph grammars can be used to model the development of diverse graph families. Since their creation in the late 1960s, graph grammars have found usage in a variety of fields, such as the design of sophisticated computer systems and electronic circuits, as well as visual languages, computer animation, and even the modelling of intricate molecular structures Replacement of edges and nodes are the two primary approaches of graph rewriting. In this paper we introduce a new type of node replacement graph grammar known as nc-eNCE graph grammar. With this new class of graph grammars we generated certain graph classes and we showed that these class of graph grammars are more powerful than the existing edge and node controlled embedding graph grammars. In addition, these graph grammars were used to model several common protein secondary structures such as parallel and anti-parallel β-sheet structures in different configurations. The use of these graph grammars in modelling other bio-chemical structures and their interactions remains to be explored. - Graph grammar for parikh word representable graphs
V. Jayakrishna, Lisa Mathew, Nobin Thomas, K.G. Subramanian, Juby Mathew
2021 International Conference on Innovative Trends in Information Technology Icitiit 2021, 2021
Graph grammars are capable of modelling the generation of various families of graphs. Graph rewriting has basically two different approaches namely, node replacement and edge replacement rewriting. A variant of node replacement graph grammar called $nc-eNCE$ graph grammars was introduced recently. Recently, a special kind of graph, called Parikh word representable graph was introduced and its properties were studied. The problem of generation of graph structures using graph grammars has been considered in many studies. Here we generate the Parikh word representable graphs using $nc-eNCE$ graph grammars. - Wiener-type indices of Parikh word representable graphs
Nobin Thomas, Lisa Mathew, Sastha Sriram, K. G. Subramanian
Ars Mathematica Contemporanea, 2021
A new class of graphs G(w), called Parikh word representable graphs (PWRG), corresponding to words $w$ that are finite sequence of symbols, was considered in the recent past. Several properties of these graphs have been established. In this paper, we consider these graphs corresponding to binary core words of the form $aub$ over a binary alphabet {a,b}. We derive formulas for computing the Wiener index of the PWRG of a binary core word. Sharp bounds are established on the value of this index in terms of different parameters related to binary words over {a,b} and the corresponding PWRGs. Certain other Wiener-type indices that are variants of Wiener index are also considered. Formulas for computing these indices in the case of PWRG of a binary core word are obtained. - Parikh Word Representable Graphs and Morphisms
Nobin Thomas, Lisa Mathew, Somnath Bera, Atulya K. Nagar, K. G. Subramanian
Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 2021 - Certain Distance-Based Topological Indices of Parikh Word Representable Graphs
Nobin Thomas, Lisa Mathew, Sastha Sriram, Atulya K. Nagar, K. G. Subramanian
Journal of Mathematics, 2021
Relating graph structures with words which are finite sequences of symbols, Parikh word representable graphs (PWRGs) were introduced. On the other hand, in chemical graph theory, graphs have been associated with molecular structures. Also, several topological indices have been defined in terms of graph parameters and studied for different classes of graphs. In this study, we derive expressions for computing certain topological indices of PWRGs of binary core words, thereby enriching the study of PWRGs. - Some results on Parikh word representable graphs and partitions
Lisa Mathew, Nobin Thomas, Somnath Bera, K.G. Subramanian
Advances in Applied Mathematics, 2019 - Automatic temporal formatting of multimedia presentations using dynamic petri nets
Susan Elias, Lisa Mathew, K. S. Easwarakumar, Richard Chbeir
Proceedings International Conference on Computer Communications and Networks ICCCN, 2009 - Modeling multimedia workflow patterns using dynamic petri nets and orc
Susan Elias, Palaniappan V, K. S. Easwarakumar, Lisa Mathew, Richard Chbeir
2007 2nd International Conference on Digital Information Management Icdim, 2007 - Providing support for interaction with consistent multimedia presentations
Journal of Digital Information Management, 2006 - Consistency checking for interactive multimedia presentations
1st IEEE International Conference on Signal Image Technology and Internet Based Systems Sitis 2005, 2005 - Infinite Lyndon words
Rani Siromoney, Lisa Mathew, V.R. Dare, K.G. Subramanian
Information Processing Letters, 1994 - Lyndon trees
K.G. Subramanian, Rani Siromoney, Lisa Mathew
Theoretical Computer Science, 1992 - Learning of recognizable picture languages
Rani Siromoney, Lisa Mathew, K. G. Subramanian, V. Rajkumar Dare
Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 1992 - A public key cryptosystem based on Lyndon words
Rani Siromoney, Lisa Mathew
Information Processing Letters, 1990
RECENT SCHOLAR PUBLICATIONS
- Trace languages generated by target-indicated spiking neural P systems with mute rules
J Sebastian, L Mathew
International Journal of Parallel, Emergent and Distributed Systems, 1-12 , 2026
2026 - Sufficiency Conditions for Well-Formedness of Quantum Context-Free Grammars
M Aruja, L Mathew, J Vijayakumar
International Journal of Foundations of Computer Science 37 (02), 361-378 , 2026
2026 - NC-ENCE Graph Grammars: Properties and Application to Game Design
J Vijayakumar, L Mathew
International Journal of Foundations of Computer Science, 1-26 , 2025
2025 - Control Languages Associated with Labelled Spiking Neural P Systems with Mute Rules
J Sebastian, L Mathew
International Journal of Foundations of Computer Science, 1-17 , 2025
2025
Citations: 2 - Hexagonal Picture Scanning Automata
L Mathew
arXiv preprint arXiv:2508.07779 , 2025
2025 - On Quantum Context-Free Grammars
M Aruja, L Mathew, J Vijayakumar
arXiv preprint arXiv:2505.13937 , 2025
2025
Citations: 2 - Proceedings of International Conference on Theoretical and Applied Computing: ICTAC 2024
L Mathew, KG Subramanian, AK Nagar
Springer Nature , 2025
2025 - On Graph Grammars and Games
J Vijayakumar, L Mathew
arXiv preprint arXiv:2403.07607 , 2024
2024 - Exploring Quantum Automata and Grammars
M Aruja, L Mathew, J Vijayakumar
International Conference on Theoretical and Applied Computing, 25-33 , 2024
2024 - An Insight Into Graph Grammars
J Vijayakumar, L Mathew
International Conference on Theoretical and Applied Computing, 51-67 , 2024
2024 - On Some Closure Properties of nc-eNCE Graph Grammars
J Vijayakumar, L Mathew
arXiv preprint arXiv:2308.05943 , 2023
2023 - On Some Closure Properties of nc-eNCE Graph Grammars
J Vijayakumar, L Mathew
arXiv preprint arXiv:2308.05943 , 2023
2023 - A new class of graph grammars and modelling of certain biological structures
J Vijayakumar, L Mathew, AK Nagar
Symmetry 15 (2), 349 , 2023
2023
Citations: 7 - On jumping graph grammars
J Vijayakumar, L Mathew, J Mathew
International Conference on Mathematics of Intelligent Computing and Data … , 2022
2022
Citations: 2 - Parikh Word Representable Graphs and Morphisms
N Thomas, L Mathew, S Bera, AK Nagar, KG Subramanian
International Conference on Developments in Language Theory, 368-379 , 2021
2021 - Wiener-type indices of Parikh word representable graphs
N Thomas, L Mathew, S Sriram, KG Subramanian
Ars Mathematica Contemporanea, 243-260 , 2021
2021
Citations: 7 - Graph Grammar for Parikh Word Representable Graphs
V Jayakrishna, L Mathew, N Thomas, KG Subramanian, J Mathew
2021 International Conference on Innovative Trends in Information Technology … , 2021
2021
Citations: 1 - Certain Distance‐Based Topological Indices of Parikh Word Representable Graphs
N Thomas, L Mathew, S Sriram, AK Nagar, KG Subramanian
Journal of Mathematics 2021 (1), 5567663 , 2021
2021
Citations: 8 - Some results on Parikh word representable graphs and partitions
L Mathew, N Thomas, S Bera, KG Subramanian
Advances in Applied Mathematics 107, 102-115 , 2019
2019
Citations: 12 - CAFSM: A Communicating Adaptive Finite State Machine for Personalized Multimedia Streaming
S Elias, L Mathew, E KS, R Chbeir, CB Jasmin
International Journal of Computer Applications 975, 8887 , 2010
2010
MOST CITED SCHOLAR PUBLICATIONS
- Infinite lyndon words
R Siromoney, L Mathew, VR Dare, KG Subramanian
Information Processing Letters 50 (2), 101-104 , 1994
1994
Citations: 58 - A public key cryptosystem based on Lyndon words
R Siromoney, L Mathew
Information Processing Letters 35 (1), 33-36 , 1990
1990
Citations: 31 - Some results on Parikh word representable graphs and partitions
L Mathew, N Thomas, S Bera, KG Subramanian
Advances in Applied Mathematics 107, 102-115 , 2019
2019
Citations: 12 - Certain Distance‐Based Topological Indices of Parikh Word Representable Graphs
N Thomas, L Mathew, S Sriram, AK Nagar, KG Subramanian
Journal of Mathematics 2021 (1), 5567663 , 2021
2021
Citations: 8 - Learning of recognizable picture languages
R Siromoney, L Mathew, KG Subramanian, VR Dare
International journal of pattern recognition and artificial intelligence 8 … , 1994
1994
Citations: 8 - Lyndon trees
KG Subramanian, R Siromoney, L Mathew
Theoretical computer science 106 (2), 373-383 , 1992
1992
Citations: 8 - A new class of graph grammars and modelling of certain biological structures
J Vijayakumar, L Mathew, AK Nagar
Symmetry 15 (2), 349 , 2023
2023
Citations: 7 - Wiener-type indices of Parikh word representable graphs
N Thomas, L Mathew, S Sriram, KG Subramanian
Ars Mathematica Contemporanea, 243-260 , 2021
2021
Citations: 7 - Learning of pattern and picture languages
R Siromoney, KG Subramanian, L Mathew
International journal of pattern recognition and artificial intelligence 6 … , 1992
1992
Citations: 6 - Automatic temporal formatting of multimedia presentations using dynamic petri nets
S Elias, L Mathew, KS Easwarakumar, R Chbeir
2009 Proceedings of 18th International Conference on Computer Communications … , 2009
2009
Citations: 5 - Control Languages Associated with Labelled Spiking Neural P Systems with Mute Rules
J Sebastian, L Mathew
International Journal of Foundations of Computer Science, 1-17 , 2025
2025
Citations: 2 - On Quantum Context-Free Grammars
M Aruja, L Mathew, J Vijayakumar
arXiv preprint arXiv:2505.13937 , 2025
2025
Citations: 2 - On jumping graph grammars
J Vijayakumar, L Mathew, J Mathew
International Conference on Mathematics of Intelligent Computing and Data … , 2022
2022
Citations: 2 - Graph Grammar for Parikh Word Representable Graphs
V Jayakrishna, L Mathew, N Thomas, KG Subramanian, J Mathew
2021 International Conference on Innovative Trends in Information Technology … , 2021
2021
Citations: 1 - Modeling multimedia workflow patterns using Dynamic Petri Nets and Orc
S Elias, V Palaniappan, KS Easwarakumar, L Mathew, R Chbeir
2007 2nd International Conference on Digital Information Management 1, 73-80 , 2007
2007
Citations: 1 - Trace languages generated by target-indicated spiking neural P systems with mute rules
J Sebastian, L Mathew
International Journal of Parallel, Emergent and Distributed Systems, 1-12 , 2026
2026 - Sufficiency Conditions for Well-Formedness of Quantum Context-Free Grammars
M Aruja, L Mathew, J Vijayakumar
International Journal of Foundations of Computer Science 37 (02), 361-378 , 2026
2026 - NC-ENCE Graph Grammars: Properties and Application to Game Design
J Vijayakumar, L Mathew
International Journal of Foundations of Computer Science, 1-26 , 2025
2025 - Hexagonal Picture Scanning Automata
L Mathew
arXiv preprint arXiv:2508.07779 , 2025
2025 - Proceedings of International Conference on Theoretical and Applied Computing: ICTAC 2024
L Mathew, KG Subramanian, AK Nagar
Springer Nature , 2025
2025
