On Equal Matrix Languages - Rani Siromoney (Inf. Control., 1969)

Channel Capacity of Equal Matrix Languages - Rani Siromoney (Inf. Control., 1969)

Finite-Turn Checking Automata. - Rani Siromoney (J. Comput. Syst. Sci., 1971)

Abstract families of matrices and picture languages. - Gift Siromoney; Rani Siromoney; Kamala Krithivasan (Comput. Graph. Image Process., 1972)

Unambiguous Equal Matrix Languages - Rani Siromoney (Inf. Control., 1972)

Picture Languages with Array Rewriting Rules - Gift Siromoney; Rani Siromoney; Kamala Krithivasan (Inf. Control., 1973)

Array Grammars and Kolam. - Gift Siromoney; Rani Siromoney; Kamala Krithivasan (Comput. Graph. Image Process., 1974)

Parallel Context-Free Languages - Rani Siromoney; Kamala Krithivasan (Inf. Control., 1974)

Control on Kolam Arrays - Rani Siromoney; K. G. Subramanian 001; K. Rangarajan (Inf. Control., 1976)

Extended Controlled Table L-Arrays - Rani Siromoney; Gift Siromoney (Inf. Control., 1977)

Selective substitution array grammars. - Rani Siromoney; K. G. Subramanian 001 (Inf. Sci., 1981)

Space-filling curves and infinite graphs. - Rani Siromoney; K. G. Subramanian 001 (Graph-Grammars and Their Application to Computer Science, 1982)

Stochastic table arrays. - Gift Siromoney; Rani Siromoney; K. G. Subramanian 001 (Comput. Graph. Image Process., 1982)

On the generative capacity of compound string and array grammars. - K. G. Subramanian 001; Rani Siromoney (Inf. Sci., 1982)

Infinite Arrays and Infinite Computations. - Rani Siromoney; V. Rajkumar Dare; K. G. Subramanian 001 (Theor. Comput. Sci., 1983)

Infinite Arrays and Controlled Deterministic Table 0L Array Systems. - Rani Siromoney; K. G. Subramanian 001; V. Rajkumar Dare (Theor. Comput. Sci., 1984)

A Generalization of the Parikh Vector for Finite and Infinite Words. - Rani Siromoney; V. Rajkumar Dare (FSTTCS, 1985)

A note on an extension of matrix grammars generating two-dimensional languages. - K. G. Subramanian 001; Rani Siromoney; Gift Siromoney (Inf. Sci., 1985)

On Infinite Words Obtained by Selective Substitution Grammars. - Rani Siromoney; V. Rajkumar Dare (Theor. Comput. Sci., 1985)

Advances in array languages. - Rani Siromoney (Graph-Grammars and Their Application to Computer Science, 1986)

Rosenfeld's cycle grammars and kolam. - Gift Siromoney; Rani Siromoney (Graph-Grammars and Their Application to Computer Science, 1986)

A public key cryptosystem that defies cryptoanalysis. - Rani Siromoney; Gift Siromoney (Bull. EATCS, 1986)

Subword Topology. - V. Rajkumar Dare; Rani Siromoney (Theor. Comput. Sci., 1986)

On Ambiguity of DTOL Systems. - K. G. Subramanian 001; Do Long Van; Rani Siromoney (FSTTCS, 1987)

A D0L-T0L Public Key Cryptosystem. - K. G. Subramanian 001; Rani Siromoney; P. J. Abisha (Inf. Process. Lett., 1987)

Encryption-Decryption Techniques for Pictures. - Rani Siromoney; K. G. Subramanian 001; P. J. Abisha (Int. J. Pattern Recognit. Artif. Intell., 1989)

Siromoney Array Grammars and Applications. - K. G. Subramanian 001; L. Revathi; Rani Siromoney (Int. J. Pattern Recognit. Artif. Intell., 1989)

Cryptosystems for Tamil. - Rani Siromoney; M. Chandrasekaran; Abdul Huq (A Perspective in Theoretical Computer Science, 1989)

Encryption-Decryption Techniques for Pictures. - Rani Siromoney; K. G. Subramanian 001; P. J. Abisha (Array Grammars, Patterns and Recognizers, 1989)

Kahbi Kolam and Cycle Grammars. - Gift Siromoney; Rani Siromoney; T. Robinson 001 (A Perspective in Theoretical Computer Science, 1989)

Map Systems with handles. - Gift Siromoney; K. G. Subramanian 001; Rani Siromoney (A Perspective in Theoretical Computer Science, 1989)

Generalized Parikh Vector and Public Key Cryptosystems. - Gift Siromoney; Rani Siromoney; K. G. Subramanian 001; V. Rajkumar Dare; P. J. Abisha (A Perspective in Theoretical Computer Science, 1989)

Siromoney Array Grammars and Applications. - K. G. Subramanian 001; L. Revathi; Rani Siromoney (Array Grammars, Patterns and Recognizers, 1989)

A Public Key Cryptosystem Based on Lyndon Words. - Rani Siromoney; Lisa Mathew (Inf. Process. Lett., 1990)

Bi-infinitary codes. - Do Long Van; D. Gnanaraj Thomas; K. G. Subramanian 001; Rani Siromoney (RAIRO Theor. Informatics Appl., 1990)

Puzzle Grammars and Context-Free Array Grammars. - Maurice Nivat; Ahmed Saoudi; K. G. Subramanian 001; Rani Siromoney; V. Rajkumar Dare (Int. J. Pattern Recognit. Artif. Intell., 1991)

A Noise Model on Learning Sets of Strings. - Yasubumi Sakakibara; Rani Siromoney (COLT, 1992)

Circular DNA and Splicing Systems. - Rani Siromoney; K. G. Subramanian 001; V. Rajkumar Dare (ICPIA, 1992)

Stochastic Puzzle Grammars. - Rani Siromoney; Abdul Huq; M. Chandrasekaran; K. G. Subramanian 001 (Int. J. Pattern Recognit. Artif. Intell., 1992)

Learning of Pattern and Picture Languages. - Rani Siromoney; K. G. Subramanian 001; Lisa Mathew (Int. J. Pattern Recognit. Artif. Intell., 1992)

Basic Puzzle Grammars and Isosceles Right Triangles. - K. G. Subramanian 001; Rani Siromoney; V. Rajkumar Dare; Ahmed Saoudi (Int. J. Pattern Recognit. Artif. Intell., 1992)

Lyndon Trees. - K. G. Subramanian 001; Rani Siromoney; Lisa Mathew (Theor. Comput. Sci., 1992)

Thue Systems and DNA - A Learning Algorithm for a Subclass. - Rani Siromoney; D. Gnanaraj Thomas; K. G. Subramanian 001; V. Rajkumar Dare (ALT, 1993)

Variations and local exceptions in inductive logic programming. - Arul Siromoney; Rani Siromoney (Machine Intelligence 14, 1993)

Learning of Recognizable Picture Languages. - Rani Siromoney; Lisa Mathew; K. G. Subramanian 001; V. Rajkumar Dare (Int. J. Pattern Recognit. Artif. Intell., 1994)

Infinite Lyndon Words. - Rani Siromoney; Lisa Mathew; V. Rajkumar Dare; K. G. Subramanian 001 (Inf. Process. Lett., 1994)

Basic Puzzle Languages. - K. G. Subramanian 001; Rani Siromoney; V. Rajkumar Dare (Int. J. Pattern Recognit. Artif. Intell., 1995)

How to Compute with DNA. - Lila Kari; Mark Daley; Greg Gloor; Rani Siromoney; Laura F. Landweber (FSTTCS, 1999)

Circular Contextual Insertions/Deletions with Applications to Biomolecular Computation. - Mark Daley; Lila Kari; Greg Gloor; Rani Siromoney (SPIRE/CRIWG, 1999)

Cell-Work OL-Systems with Fins. - T. Robinson 001; K. G. Subramanian 001; Rani Siromoney; V. Rajkumar Dare (Int. J. Pattern Recognit. Artif. Intell., 1999)

Some results on picture languages. - Rani Siromoney; K. G. Subramanian 001; V. Rajkumar Dare; D. Gnanaraj Thomas (Pattern Recognit., 1999)

Infinite Arrays and Recognizability. - V. Rajkumar Dare; K. G. Subramanian 001; D. Gnanaraj Thomas; Rani Siromoney; B. Le Saec (Int. J. Pattern Recognit. Artif. Intell., 2000)

DNA algorithm for breaking a propositional logic based cryptosystem. - Rani Siromoney; Bireswar Das (Bull. EATCS, 2003)

Plasmids to Solve #3SAT. - Rani Siromoney; Bireswar Das (Aspects of Molecular Computing, 2004)

Contextial Insertion for #3SAT. - B. Subramaniam; Rani Siromoney (Bull. EATCS, 2006)

Contextual-insertion to solve #P version of the Square-Tiling Problem. - Rani Siromoney (BIC-TA, 2010)

Non-isometric Contextual Array Grammars with Regular Control and Local Selectors. - Henning Fernau; Rudolf Freund; Rani Siromoney; K. G. Subramanian 001 (MCU, 2015)

Contextual Array Grammars with Matrix and Regular Control. - Henning Fernau; Rudolf Freund; Rani Siromoney; K. G. Subramanian 001 (DCFS, 2016)

Non-Isometric Contextual Array Grammars and the Role of Regular Control and Local Selectors. - Henning Fernau; Rudolf Freund; Rani Siromoney; K. G. Subramanian 001 (Fundam. Informaticae, 2017)

Contextual array grammars with matrix control, regular control languages, and tissue P systems control. - Artiom Alhazov; Henning Fernau; Rudolf Freund; Sergiu Ivanov 001; Rani Siromoney; K. G. Subramanian 001 (Theor. Comput. Sci., 2017)