| 2004 |
|---|
| 43 | EE | Rani Siromoney,
Bireswar Das:
Plasmids to Solve #3SAT.
Aspects of Molecular Computing 2004: 361-366 |
| 2003 |
|---|
| 42 | | Rani Siromoney,
Bireswar Das:
DNA algorithm for breaking a propositional logic based cryptosystem.
Bulletin of the EATCS 79: 170-177 (2003) |
| 2000 |
|---|
| 41 | EE | V. Rajkumar Dare,
K. G. Subramanian,
D. G. Thomas,
Rani Siromoney,
B. Le Saec:
Infinite Arrays and Recognizability.
IJPRAI 14(4): 525-536 (2000) |
| 1999 |
|---|
| 40 | EE | Lila Kari,
Mark Daley,
Greg Gloor,
Rani Siromoney,
Laura F. Landweber:
How to Compute with DNA.
FSTTCS 1999: 269-282 |
| 39 | EE | Mark Daley,
Lila Kari,
Greg Gloor,
Rani Siromoney:
Circular Contextual Insertions/Deletions with Applications to Biomolecular Computation.
SPIRE/CRIWG 1999: 47-54 |
| 38 | | T. Robinson,
K. G. Subramanian,
Rani Siromoney,
V. Rajkumar Dare:
Cell-Work OL-Systems with Fins.
IJPRAI 13(4): 539-553 (1999) |
| 37 | EE | Rani Siromoney,
K. G. Subramanian,
V. Rajkumar Dare,
D. G. Thomas:
Some results on picture languages.
Pattern Recognition 32(2): 295-304 (1999) |
| 1995 |
|---|
| 36 | | K. G. Subramanian,
Rani Siromoney,
V. Rajkumar Dare:
Basic Puzzle Languages.
IJPRAI 9(5): 763-775 (1995) |
| 1994 |
|---|
| 35 | | Rani Siromoney,
Lisa Mathew,
K. G. Subramanian,
V. Rajkumar Dare:
Learning of Recognizable Picture Languages.
IJPRAI 8(2): 627-639 (1994) |
| 34 | | Rani Siromoney,
Lisa Mathew,
V. Rajkumar Dare,
K. G. Subramanian:
Infinite Lyndon Words.
Inf. Process. Lett. 50(2): 101-104 (1994) |
| 1993 |
|---|
| 33 | | Rani Siromoney,
D. G. Thomas,
K. G. Subramanian,
V. Rajkumar Dare:
Thue Systems and DNA - A Learning Algorithm for a Subclass.
ALT 1993: 314-327 |
| 32 | | Arul Siromoney,
Rani Siromoney:
Variations and local exceptions in inductive logic programming.
Machine Intelligence 14 1993: 213-234 |
| 1992 |
|---|
| 31 | EE | Yasubumi Sakakibara,
Rani Siromoney:
A Noise Model on Learning Sets of Strings.
COLT 1992: 295-302 |
| 30 | | Rani Siromoney,
Lisa Mathew,
K. G. Subramanian,
V. Rajkumar Dare:
Learning of Recognizable Picture Languages.
ICPIA 1992: 247-259 |
| 29 | | Rani Siromoney,
K. G. Subramanian,
V. Rajkumar Dare:
Circular DNA and Splicing Systems.
ICPIA 1992: 260-273 |
| 28 | | Rani Siromoney,
Abdul Huq,
M. Chandrasekaran,
K. G. Subramanian:
Stochastic Puzzle Grammars.
IJPRAI 6(2&3): 257-273 (1992) |
| 27 | | Rani Siromoney,
K. G. Subramanian,
Lisa Mathew:
Learning of Pattern and Picture Languages.
IJPRAI 6(2&3): 275-284 (1992) |
| 26 | | K. G. Subramanian,
Rani Siromoney,
V. Rajkumar Dare,
Ahmed Saoudi:
Basic Puzzle Grammars and Isosceles Right Triangles.
IJPRAI 6(5): 799-816 (1992) |
| 25 | | K. G. Subramanian,
Rani Siromoney,
Lisa Mathew:
Lyndon Trees.
Theor. Comput. Sci. 106(2): 373-383 (1992) |
| 1990 |
|---|
| 24 | | Do Long Van,
D. G. Thomas,
K. G. Subramanian,
Rani Siromoney:
Bi-infinitary codes.
ITA 24: 67-88 (1990) |
| 23 | | Rani Siromoney,
Lisa Mathew:
A Public Key Cryptosystem Based on Lyndon Words.
Inf. Process. Lett. 35(1): 33-36 (1990) |
| 1987 |
|---|
| 22 | | K. G. Subramanian,
Do Long Van,
Rani Siromoney:
On Ambiguity of DTOL Systems.
FSTTCS 1987: 3-14 |
| 21 | | K. G. Subramanian,
Rani Siromoney,
P. J. Abisha:
A D0L-T0L Public Key Cryptosystem.
Inf. Process. Lett. 26(2): 95-97 (1987) |
| 1986 |
|---|
| 20 | | Rani Siromoney:
Advances in array languages.
Graph-Grammars and Their Application to Computer Science 1986: 549-563 |
| 19 | | Gift Siromoney,
Rani Siromoney:
Rosenfeld's cycle grammars and kolam.
Graph-Grammars and Their Application to Computer Science 1986: 564-579 |
| 18 | | Rani Siromoney,
Gift Siromoney:
A public key cryptosystem that defies cryptoanalysis.
Bulletin of the EATCS 28: 37-43 (1986) |
| 17 | | V. Rajkumar Dare,
Rani Siromoney:
Subword Topology.
Theor. Comput. Sci. 47(3): 159-168 (1986) |
| 1985 |
|---|
| 16 | | Rani Siromoney,
V. Rajkumar Dare:
A Generalization of the Parikh Vector for Finite and Infinite Words.
FSTTCS 1985: 290-302 |
| 15 | EE | K. G. Subramanian,
Rani Siromoney,
Gift Siromoney:
A note on an extension of matrix grammars generating two-dimensional languages.
Inf. Sci. 35(3): 223-233 (1985) |
| 14 | | Rani Siromoney,
V. Rajkumar Dare:
On Infinite Words Obtained by Selective Substitution Grammars.
Theor. Comput. Sci. 39: 281-295 (1985) |
| 1984 |
|---|
| 13 | | Rani Siromoney,
K. G. Subramanian,
V. Rajkumar Dare:
Infinite Arrays and Controlled Deterministic Table 0L Array Systems.
Theor. Comput. Sci. 33: 3-11 (1984) |
| 1983 |
|---|
| 12 | | Rani Siromoney,
V. Rajkumar Dare,
K. G. Subramanian:
Infinite Arrays and Infinite Computations.
Theor. Comput. Sci. 24: 195-205 (1983) |
| 1982 |
|---|
| 11 | | Rani Siromoney,
K. G. Subramanian:
Space-filling curves and infinite graphs.
Graph-Grammars and Their Application to Computer Science 1982: 380-391 |
| 10 | EE | K. G. Subramanian,
Rani Siromoney:
On the generative capacity of compound string and array grammars.
Inf. Sci. 26(3): 231-241 (1982) |
| 1981 |
|---|
| 9 | EE | Rani Siromoney,
K. G. Subramanian:
Selective substitution array grammars.
Inf. Sci. 25(1): 73-83 (1981) |
| 1977 |
|---|
| 8 | | Rani Siromoney,
Gift Siromoney:
Extended Controlled Table L-Arrays
Information and Control 35(2): 119-138 (1977) |
| 1976 |
|---|
| 7 | | Rani Siromoney,
K. G. Subramanian,
K. Rangarajan:
Control on Kolam Arrays
Information and Control 32(3): 272-275 (1976) |
| 1974 |
|---|
| 6 | | Rani Siromoney,
Kamala Krithivasan:
Parallel Context-Free Languages
Information and Control 24(2): 155-162 (1974) |
| 1973 |
|---|
| 5 | | Gift Siromoney,
Rani Siromoney,
Kamala Krithivasan:
Picture Languages with Array Rewriting Rules
Information and Control 22(5): 447-470 (1973) |
| 1972 |
|---|
| 4 | | Rani Siromoney:
Unambiguous Equal Matrix Languages
Information and Control 20(1): 1-8 (1972) |
| 1971 |
|---|
| 3 | | Rani Siromoney:
Finite-Turn Checking Automata.
J. Comput. Syst. Sci. 5(6): 549-559 (1971) |
| 1969 |
|---|
| 2 | | Rani Siromoney:
On Equal Matrix Languages
Information and Control 14(2): 135-151 (1969) |
| 1 | | Rani Siromoney:
Channel Capacity of Equal Matrix Languages
Information and Control 14(6): 507-511 (1969) |
