Lakshmanan Kuppusamy

Proceedings of the 16th International Conference on Automata and Formal Languages, 2023

2022

A novel approach on energy-efficient clustering protocol for wireless sensor networks.

[BibT_eX]

[DOI]

Int. J. Commun. Syst., 2022

On the computational completeness of matrix simple semi-conditional grammars.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Correction to: A hybrid approach to energy efficient clustering and routing in wireless sensor networks.

[BibT_eX]

[DOI]

Evol. Intell., 2022

A hybrid approach to energy efficient clustering and routing in wireless sensor networks.

[BibT_eX]

[DOI]

Evol. Intell., 2022

Improved descriptional complexity results on generalized forbidding grammars.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

2021

Adaptive Drift Detection Mechanism for Non-Stationary Data Stream.

[BibT_eX]

[DOI]

Nalini Nagendhiran

J. Inf. Knowl. Manag., March, 2021

On the generative capacity of matrix insertion-deletion systems of small sum-norm.

[BibT_eX]

[DOI]

Nat. Comput., 2021

Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2021

A formal methods approach to predicting new features of the eukaryotic vesicle traffic system.

[BibT_eX]

[DOI]

Acta Informatica, 2021

2020

Universal insertion grammars of size two.

[BibT_eX]

[DOI]

Sergey Verlan

Theor. Comput. Sci., 2020

Generalized Forbidding Matrix Grammars and Their Membrane Computing Perspective.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 2020

On the Power of Generalized Forbidding Insertion-Deletion Systems.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2020

2019

Computational completeness of simple semi-conditional insertion-deletion systems of degree (2, 1).

[BibT_eX]

[DOI]

Nat. Comput., 2019

On path-controlled insertion-deletion systems.

[BibT_eX]

[DOI]

Acta Informatica, 2019

On Matrix Ins-Del Systems of Small Sum-Norm.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

Descriptional Complexity of Matrix Simple Semi-conditional Grammars.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2019

2018

Investigations on the power of matrix insertion-deletion systems with small sizes.

[BibT_eX]

[DOI]

Nat. Comput., 2018

Overlapping community detection in social networks using coalitional games.

[BibT_eX]

[DOI]

Annapurna Jonnalagadda

Knowl. Inf. Syst., 2018

Properties of Language Classes Between Linear and Context-Free.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2018

On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2018

Computational Completeness of Simple Semi-conditional Insertion-Deletion Systems.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computation and Natural Computation, 2018

Minimizing Rules and Nonterminals in Semi-conditional Grammars: Non-trivial for the Simple Case.

[BibT_eX]

[DOI]

Proceedings of the Machines, Computations, and Universality - 8th International Conference, 2018

An Augmented Algorithm for Energy Efficient Clustering.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Systems Design and Applications, 2018

New Nonterminal Complexity Results for Semi-conditional Grammars.

[BibT_eX]

[DOI]

Rufus O. Oladele

Proceedings of the Sailing Routes in the World of Computation, 2018

2017

On the computational completeness of graph-controlled insertion-deletion systems with binary sizes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2017

Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2017

Universal Matrix Insertion Grammars with Small Size.

[BibT_eX]

[DOI]

Sergey Verlan

Proceedings of the Unconventional Computation and Natural Computation, 2017

Parikh Images of Matrix Ins-Del Systems.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2017

Mining Communities in Directed Networks: A Game Theoretic Approach.

[BibT_eX]

[DOI]

Annapurna Jonnalagadda

Proceedings of the Intelligent Systems Design and Applications, 2017

Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2017

2016

A survey on game theoretic models for community detection in social networks.

[BibT_eX]

[DOI]

Annapurna Jonnalagadda

Soc. Netw. Anal. Min., 2016

On Succinct Description of Certain Context-Free Languages by Ins-Del and Matrix Ins-Del Systems.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2016

Modelling DNA and RNA secondary structures using matrix insertion-deletion systems.

[BibT_eX]

[DOI]

Int. J. Appl. Math. Comput. Sci., 2016

Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computation and Natural Computation, 2016

1-Normal DRA for Insertion Languages.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

Formal Language Representation and Modelling Structures Underlying RNA Folding Process.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2016

2014

Edge-Disjoint Fibonacci Trees in Hypercube.

[BibT_eX]

[DOI]

J. Comput. Networks Commun., 2014

2013

On the Trade-off Between Ambiguity and Complexity in Contextual Languages.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2013

2011

On the study of ambiguity and the trade-off between measures and ambiguity in insertion-deletion languages.

[BibT_eX]

[DOI]

Nano Commun. Networks, 2011

On the Ambiguity of Insertion Systems.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

Matrix Insertion-Deletion Systems for Bio-Molecular Structures.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Internet Technology, 2011

Modelling Intermolecular Structures and Defining Ambiguity in Gene Sequences using Matrix Insertion-Deletion Systems.

[BibT_eX]

[DOI]

Éric Villemonte de la Clergerie

Proceedings of the Biology, Computation and Linguistics - New Interdisciplinary Paradigms, 2011

2010

On the Ambiguity and Complexity Measures of Insertion-Deletion Systems.

[BibT_eX]

[DOI]

Proceedings of the Bio-Inspired Models of Network, Information, and Computing Systems, 2010

2009

Verifying epistemic protocols under common knowledge.

[BibT_eX]

[DOI]

Yanjing Wang

Jan van Eijck

Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2009), 2009

On the Relative Expressive Power of Contextual Grammars with Maximal and Depth-First Derivations.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing, 2009

2008

On the Trade-Off Between Ambiguity and Measures in Internal Contextual Grammars.

[BibT_eX]

Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

2007

The Computational Efficiency of Insertion Deletion Tissue P Systems.

[BibT_eX]

[DOI]

R. Rama

Proceedings of the Formal Models, 2007

2006

A note on ambiguity of internal contextual grammars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

End-Marked Maximal Depth-First Contextual Grammars.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005

Further Results on Syntactic Ambiguity of Internal Contextual Grammars.

[BibT_eX]

[DOI]

Proceedings of the Finite-State Methods and Natural Language Processing, 2005

Incompatible Measures of Internal Contextual Grammars.

[BibT_eX]

Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

2003

On Some Classes of Contextual Grammars.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2003

Descriptional Complexity of Rewriting Tissue P Systems.

[BibT_eX]

Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003

2002

On the Power of P Systems with Contextual Rules.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2002

Tissue P Systems with Contextual and Rewriting Rules.

[BibT_eX]

[DOI]