According to our database1, Indhumathi Raman authored at least 19 papers between 2009 and 2019.
Legend:Book In proceedings Article PhD thesis Other
On path-controlled insertion-deletion systems.
Acta Inf., 2019
On Matrix Ins-Del Systems of Small Sum-Norm.
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019
Improved Descriptional Complexity Results on Generalized Forbidding Grammars.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2019
Investigations on the power of matrix insertion-deletion systems with small sizes.
Natural Computing, 2018
Properties of Language Classes Between Linear and Context-Free.
Journal of Automata, Languages and Combinatorics, 2018
On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems.
RAIRO - Theor. Inf. and Applic., 2018
Computational Completeness of Simple Semi-conditional Insertion-Deletion Systems.
Proceedings of the Unconventional Computation and Natural Computation, 2018
Minimizing Rules and Nonterminals in Semi-conditional Grammars: Non-trivial for the Simple Case.
Proceedings of the Machines, Computations, and Universality - 8th International Conference, 2018
On the computational completeness of graph-controlled insertion-deletion systems with binary sizes.
Theor. Comput. Sci., 2017
On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes.
Journal of Automata, Languages and Combinatorics, 2017
Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems.
Proceedings of the Implementation and Application of Automata, 2017
Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity.
Proceedings of the Descriptional Complexity of Formal Systems, 2017
On Succinct Description of Certain Context-Free Languages by Ins-Del and Matrix Ins-Del Systems.
Int. J. Found. Comput. Sci., 2016
Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion.
Proceedings of the Unconventional Computation and Natural Computation, 2016
Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems.
Proceedings of the Descriptional Complexity of Formal Systems, 2016
Edge-Disjoint Fibonacci Trees in Hypercube.
Journal Comp. Netw. and Communic., 2014
Embedding certain height-balanced trees and complete pm-ary trees into hypercubes.
J. Discrete Algorithms, 2013
On Embedding of Certain Recursive Trees and Stars into Hypercube.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013
On embedding subclasses of height-balanced trees in hypercubes.
Inf. Sci., 2009