default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRani Siromoney
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j39]Henning Fernau
, Rudolf Freund, Rani Siromoney, K. G. Subramanian:
Non-Isometric Contextual Array Grammars and the Role of Regular Control and Local Selectors. Fundam. Informaticae 155(1-2): 209-232 (2017)- [j38]Artiom Alhazov, Henning Fernau, Rudolf Freund, Sergiu Ivanov, Rani Siromoney, K. G. Subramanian:
Contextual array grammars with matrix control, regular control languages, and tissue P systems control. Theor. Comput. Sci. 682: 5-21 (2017) - 2016
- [c16]Henning Fernau, Rudolf Freund, Rani Siromoney, K. G. Subramanian:
Contextual Array Grammars with Matrix and Regular Control. DCFS 2016: 98-110 - 2015
- [c15]Henning Fernau, Rudolf Freund, Rani Siromoney, K. G. Subramanian:
Non-isometric Contextual Array Grammars with Regular Control and Local Selectors. MCU 2015: 61-78 - 2010
- [c14]Rani Siromoney:
Contextual-insertion to solve #P version of the Square-Tiling Problem. BIC-TA 2010: 1308-1313
2000 – 2009
- 2006
- [j37]B. Subramaniam, Rani Siromoney:
Contextial Insertion for #3SAT. Bull. EATCS 88: 174-181 (2006) - 2004
- [c13]Rani Siromoney, Bireswar Das:
Plasmids to Solve #3SAT. Aspects of Molecular Computing 2004: 361-366 - 2003
- [j36]Rani Siromoney, Bireswar Das:
DNA algorithm for breaking a propositional logic based cryptosystem. Bull. EATCS 79: 170-177 (2003) - 2000
- [j35]V. Rajkumar Dare, K. G. Subramanian, D. Gnanaraj Thomas, Rani Siromoney, B. Le Saec:
Infinite Arrays and Recognizability. Int. J. Pattern Recognit. Artif. Intell. 14(4): 525-536 (2000)
1990 – 1999
- 1999
- [j34]T. Robinson, K. G. Subramanian, Rani Siromoney, V. Rajkumar Dare:
Cell-Work OL-Systems with Fins. Int. J. Pattern Recognit. Artif. Intell. 13(4): 539-553 (1999) - [j33]Rani Siromoney, K. G. Subramanian, V. Rajkumar Dare, D. Gnanaraj Thomas:
Some results on picture languages. Pattern Recognit. 32(2): 295-304 (1999) - [c12]Lila Kari, Mark Daley, Greg Gloor, Rani Siromoney, Laura F. Landweber:
How to Compute with DNA. FSTTCS 1999: 269-282 - [c11]Mark Daley, Lila Kari, Greg Gloor, Rani Siromoney:
Circular Contextual Insertions/Deletions with Applications to Biomolecular Computation. SPIRE/CRIWG 1999: 47-54 - 1995
- [j32]K. G. Subramanian, Rani Siromoney, V. Rajkumar Dare:
Basic Puzzle Languages. Int. J. Pattern Recognit. Artif. Intell. 9(5): 763-775 (1995) - 1994
- [j31]Rani Siromoney, Lisa Mathew, K. G. Subramanian, V. Rajkumar Dare:
Learning of Recognizable Picture Languages. Int. J. Pattern Recognit. Artif. Intell. 8(2): 627-639 (1994) - [j30]Rani Siromoney, Lisa Mathew, V. Rajkumar Dare, K. G. Subramanian:
Infinite Lyndon Words. Inf. Process. Lett. 50(2): 101-104 (1994) - 1993
- [c10]Rani Siromoney, D. Gnanaraj Thomas, K. G. Subramanian, V. Rajkumar Dare:
Thue Systems and DNA - A Learning Algorithm for a Subclass. ALT 1993: 314-327 - [c9]Arul Siromoney, Rani Siromoney:
Variations and local exceptions in inductive logic programming. Machine Intelligence 14 1993: 213-234 - 1992
- [j29]Rani Siromoney, Abdul Huq, M. Chandrasekaran, K. G. Subramanian:
Stochastic Puzzle Grammars. Int. J. Pattern Recognit. Artif. Intell. 6(2&3): 257-273 (1992) - [j28]Rani Siromoney, K. G. Subramanian, Lisa Mathew:
Learning of Pattern and Picture Languages. Int. J. Pattern Recognit. Artif. Intell. 6(2&3): 275-284 (1992) - [j27]K. G. Subramanian, Rani Siromoney, V. Rajkumar Dare, Ahmed Saoudi:
Basic Puzzle Grammars and Isosceles Right Triangles. Int. J. Pattern Recognit. Artif. Intell. 6(5): 799-816 (1992) - [j26]K. G. Subramanian, Rani Siromoney, Lisa Mathew:
Lyndon Trees. Theor. Comput. Sci. 106(2): 373-383 (1992) - [c8]Yasubumi Sakakibara, Rani Siromoney:
A Noise Model on Learning Sets of Strings. COLT 1992: 295-302 - [c7]Rani Siromoney, Lisa Mathew, K. G. Subramanian, V. Rajkumar Dare:
Learning of Recognizable Picture Languages. ICPIA 1992: 247-259 - [c6]Rani Siromoney, K. G. Subramanian, V. Rajkumar Dare:
Circular DNA and Splicing Systems. ICPIA 1992: 260-273 - 1991
- [j25]Maurice Nivat, Ahmed Saoudi, K. G. Subramanian, Rani Siromoney, V. Rajkumar Dare:
Puzzle Grammars and Context-Free Array Grammars. Int. J. Pattern Recognit. Artif. Intell. 5(5): 663-676 (1991) - 1990
- [j24]Rani Siromoney, Lisa Mathew:
A Public Key Cryptosystem Based on Lyndon Words. Inf. Process. Lett. 35(1): 33-36 (1990) - [j23]Do Long Van, D. Gnanaraj Thomas, K. G. Subramanian, Rani Siromoney:
Bi-infinitary codes. RAIRO Theor. Informatics Appl. 24: 67-87 (1990)
1980 – 1989
- 1989
- [j22]K. G. Subramanian, L. Revathi, Rani Siromoney:
Siromoney Array Grammars and Applications. Int. J. Pattern Recognit. Artif. Intell. 3(3-4): 333-352 (1989) - [j21]Rani Siromoney, K. G. Subramanian, P. J. Abisha:
Encryption-Decryption Techniques for Pictures. Int. J. Pattern Recognit. Artif. Intell. 3(3-4): 497- (1989) - [p6]K. G. Subramanian, L. Revathi, Rani Siromoney:
Siromoney Array Grammars and Applications. Array Grammars, Patterns and Recognizers 1989: 55-74 - [p5]Rani Siromoney, K. G. Subramanian, P. J. Abisha:
Encryption-Decryption Techniques for Pictures. Array Grammars, Patterns and Recognizers 1989: 219- - [p4]Gift Siromoney, Rani Siromoney, T. Robinson:
Kahbi Kolam and Cycle Grammars. A Perspective in Theoretical Computer Science 1989: 267-300 - [p3]Gift Siromoney, Rani Siromoney, K. G. Subramanian, V. Rajkumar Dare, P. J. Abisha:
Generalized Parikh Vector and Public Key Cryptosystems. A Perspective in Theoretical Computer Science 1989: 301-323 - [p2]Gift Siromoney, K. G. Subramanian, Rani Siromoney:
Map Systems with handles. A Perspective in Theoretical Computer Science 1989: 324-352 - [p1]Rani Siromoney, M. Chandrasekaran, Abdul Huq:
Cryptosystems for Tamil. A Perspective in Theoretical Computer Science 1989: 353-379 - 1987
- [j20]K. G. Subramanian, Rani Siromoney, P. J. Abisha:
A D0L-T0L Public Key Cryptosystem. Inf. Process. Lett. 26(2): 95-97 (1987) - [c5]K. G. Subramanian, Do Long Van, Rani Siromoney:
On Ambiguity of DTOL Systems. FSTTCS 1987: 3-14 - 1986
- [j19]Rani Siromoney, Gift Siromoney:
A public key cryptosystem that defies cryptoanalysis. Bull. EATCS 28: 37-43 (1986) - [j18]V. Rajkumar Dare, Rani Siromoney:
Subword Topology. Theor. Comput. Sci. 47(3): 159-168 (1986) - [c4]Rani Siromoney:
Advances in array languages. Graph-Grammars and Their Application to Computer Science 1986: 549-563 - [c3]Gift Siromoney, Rani Siromoney:
Rosenfeld's cycle grammars and kolam. Graph-Grammars and Their Application to Computer Science 1986: 564-579 - 1985
- [j17]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) - [j16]Rani Siromoney, V. Rajkumar Dare:
On Infinite Words Obtained by Selective Substitution Grammars. Theor. Comput. Sci. 39: 281-295 (1985) - [c2]Rani Siromoney, V. Rajkumar Dare:
A Generalization of the Parikh Vector for Finite and Infinite Words. FSTTCS 1985: 290-302 - 1984
- [j15]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
- [j14]Rani Siromoney, V. Rajkumar Dare, K. G. Subramanian:
Infinite Arrays and Infinite Computations. Theor. Comput. Sci. 24: 195-205 (1983) - 1982
- [j13]Gift Siromoney, Rani Siromoney, K. G. Subramanian:
Stochastic table arrays. Comput. Graph. Image Process. 18(2): 202-211 (1982) - [j12]K. G. Subramanian, Rani Siromoney:
On the generative capacity of compound string and array grammars. Inf. Sci. 26(3): 231-241 (1982) - [c1]Rani Siromoney, K. G. Subramanian:
Space-filling curves and infinite graphs. Graph-Grammars and Their Application to Computer Science 1982: 380-391 - 1981
- [j11]Rani Siromoney, K. G. Subramanian:
Selective substitution array grammars. Inf. Sci. 25(1): 73-83 (1981)
1970 – 1979
- 1977
- [j10]Rani Siromoney, Gift Siromoney:
Extended Controlled Table L-Arrays. Inf. Control. 35(2): 119-138 (1977) - 1976
- [j9]Rani Siromoney, K. G. Subramanian, K. Rangarajan:
Control on Kolam Arrays. Inf. Control. 32(3): 272-275 (1976) - 1974
- [j8]Gift Siromoney, Rani Siromoney, Kamala Krithivasan:
Array Grammars and Kolam. Comput. Graph. Image Process. 3(1): 63-82 (1974) - [j7]Rani Siromoney, Kamala Krithivasan:
Parallel Context-Free Languages. Inf. Control. 24(2): 155-162 (1974) - 1973
- [j6]Gift Siromoney, Rani Siromoney, Kamala Krithivasan:
Picture Languages with Array Rewriting Rules. Inf. Control. 22(5): 447-470 (1973) - 1972
- [j5]Gift Siromoney, Rani Siromoney, Kamala Krithivasan:
Abstract families of matrices and picture languages. Comput. Graph. Image Process. 1(3): 284-307 (1972) - [j4]Rani Siromoney:
Unambiguous Equal Matrix Languages. Inf. Control. 20(1): 1-8 (1972) - 1971
- [j3]Rani Siromoney:
Finite-Turn Checking Automata. J. Comput. Syst. Sci. 5(6): 549-559 (1971)
1960 – 1969
- 1969
- [j2]Rani Siromoney:
On Equal Matrix Languages. Inf. Control. 14(2): 135-151 (1969) - [j1]Rani Siromoney:
Channel Capacity of Equal Matrix Languages. Inf. Control. 14(6): 507-511 (1969)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
