Indhumathi Raman

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

Matrix Forbidding Grammars.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2025

Generalized Lettericity of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2025

2024

On the computational completeness of generalized forbidding matrix grammars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2024

Chromatic numbers of certain hypercube variants.

[BibT_eX]

[DOI]

Int. J. Comput. Math. Comput. Syst. Theory, 2024

Succinct Star-Controlled Insertion-Deletion Systems Using Space Separating Normal Forms.

[BibT_eX]

[DOI]

Proceedings of the Machines, Computations, and Universality, 2024

Counting Simple Rules in Semi-conditional Grammars is not Simple.

[BibT_eX]

[DOI]

Proceedings of the Twenty Years of Theoretical and Practical Synergies, 2024

2023

When Stars Control a Grammar's Work.

[BibT_eX]

[DOI]

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

2022

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

[BibT_eX]

[DOI]

Inf. Comput., 2022

Improved descriptional complexity results on generalized forbidding grammars.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

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

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

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

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

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

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2017

2016

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

[BibT_eX]

[DOI]

Kamala Krithivasan

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

Certain height-balanced subtrees of hypercubes.

[BibT_eX]

[DOI]

Int. J. Comput. Math. Comput. Syst. Theory, 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

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

Embedding certain height-balanced trees and complete pm-ary trees into hypercubes.

[BibT_eX]

[DOI]

Sheshayya A. Choudum

J. Discrete Algorithms, 2013

On Embedding of Certain Recursive Trees and Stars into Hypercube.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

2009

On embedding subclasses of height-balanced trees in hypercubes.

[BibT_eX]

[DOI]

Sheshayya A. Choudum