Rani Siromoney

According to our database1, Rani Siromoney authored at least 60 papers between 1969 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
Contextual array grammars with matrix control, regular control languages, and tissue P systems control.
Theor. Comput. Sci., 2017

Non-Isometric Contextual Array Grammars and the Role of Regular Control and Local Selectors.
Fundam. Informaticae, 2017

2016
Contextual Array Grammars with Matrix and Regular Control.
Proceedings of the Descriptional Complexity of Formal Systems, 2016

2015
Non-isometric Contextual Array Grammars with Regular Control and Local Selectors.
Proceedings of the Machines, Computations, and Universality - 7th International Conference, 2015

2010
Contextual-insertion to solve #P version of the Square-Tiling Problem.
Proceedings of the Fifth International Conference on Bio-Inspired Computing: Theories and Applications, 2010

2006
Contextial Insertion for #3SAT.
Bull. EATCS, 2006

2004
Plasmids to Solve #3SAT.
Proceedings of the Aspects of Molecular Computing, 2004

2003
DNA algorithm for breaking a propositional logic based cryptosystem.
Bull. EATCS, 2003

2000
Infinite Arrays and Recognizability.
Int. J. Pattern Recognit. Artif. Intell., 2000

1999
Some results on picture languages.
Pattern Recognit., 1999

Cell-Work OL-Systems with Fins.
Int. J. Pattern Recognit. Artif. Intell., 1999

Circular Contextual Insertions/Deletions with Applications to Biomolecular Computation.
Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999

How to Compute with DNA.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

1995
Basic Puzzle Languages.
Int. J. Pattern Recognit. Artif. Intell., 1995

1994
Infinite Lyndon Words.
Inf. Process. Lett., 1994

Learning of Recognizable Picture Languages.
Int. J. Pattern Recognit. Artif. Intell., 1994

1993
Variations and local exceptions in inductive logic programming.
Proceedings of the Machine Intelligence 14, 1993

Thue Systems and DNA - A Learning Algorithm for a Subclass.
Proceedings of the Algorithmic Learning Theory, 4th International Workshop, 1993

1992
Lyndon Trees.
Theor. Comput. Sci., 1992

Basic Puzzle Grammars and Isosceles Right Triangles.
Int. J. Pattern Recognit. Artif. Intell., 1992

Learning of Pattern and Picture Languages.
Int. J. Pattern Recognit. Artif. Intell., 1992

Stochastic Puzzle Grammars.
Int. J. Pattern Recognit. Artif. Intell., 1992

Circular DNA and Splicing Systems.
Proceedings of the Parallel Image Analysis, Second International Conference, 1992

A Noise Model on Learning Sets of Strings.
Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

1991
Puzzle Grammars and Context-Free Array Grammars.
Int. J. Pattern Recognit. Artif. Intell., 1991

1990
Bi-infinitary codes.
RAIRO Theor. Informatics Appl., 1990

A Public Key Cryptosystem Based on Lyndon Words.
Inf. Process. Lett., 1990

1989
Siromoney Array Grammars and Applications.
Proceedings of the Array Grammars, Patterns and Recognizers, 1989

Generalized Parikh Vector and Public Key Cryptosystems.
Proceedings of the A Perspective in Theoretical Computer Science, 1989

Map Systems with handles.
Proceedings of the A Perspective in Theoretical Computer Science, 1989

Kahbi Kolam and Cycle Grammars.
Proceedings of the A Perspective in Theoretical Computer Science, 1989

Encryption-Decryption Techniques for Pictures.
Proceedings of the Array Grammars, Patterns and Recognizers, 1989

Cryptosystems for Tamil.
Proceedings of the A Perspective in Theoretical Computer Science, 1989

Siromoney Array Grammars and Applications.
Int. J. Pattern Recognit. Artif. Intell., 1989

Encryption-Decryption Techniques for Pictures.
Int. J. Pattern Recognit. Artif. Intell., 1989

1987
A D0L-T0L Public Key Cryptosystem.
Inf. Process. Lett., 1987

On Ambiguity of DTOL Systems.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

1986
Subword Topology.
Theor. Comput. Sci., 1986

A public key cryptosystem that defies cryptoanalysis.
Bull. EATCS, 1986

Rosenfeld's cycle grammars and kolam.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1986

Advances in array languages.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1986

1985
On Infinite Words Obtained by Selective Substitution Grammars.
Theor. Comput. Sci., 1985

A note on an extension of matrix grammars generating two-dimensional languages.
Inf. Sci., 1985

A Generalization of the Parikh Vector for Finite and Infinite Words.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1985

1984
Infinite Arrays and Controlled Deterministic Table 0L Array Systems.
Theor. Comput. Sci., 1984

1983
Infinite Arrays and Infinite Computations.
Theor. Comput. Sci., 1983

1982
On the generative capacity of compound string and array grammars.
Inf. Sci., 1982

Stochastic table arrays.
Comput. Graph. Image Process., 1982

Space-filling curves and infinite graphs.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1982

1981
Selective substitution array grammars.
Inf. Sci., 1981

1977
Extended Controlled Table L-Arrays
Inf. Control., October, 1977

1976
Control on Kolam Arrays
Inf. Control., November, 1976

1974
Parallel Context-Free Languages
Inf. Control., February, 1974

Array Grammars and Kolam.
Comput. Graph. Image Process., 1974

1973
Picture Languages with Array Rewriting Rules
Inf. Control., June, 1973

1972
Unambiguous Equal Matrix Languages
Inf. Control., February, 1972

Abstract families of matrices and picture languages.
Comput. Graph. Image Process., 1972

1971
Finite-Turn Checking Automata.
J. Comput. Syst. Sci., 1971

1969
Channel Capacity of Equal Matrix Languages
Inf. Control., June, 1969

On Equal Matrix Languages
Inf. Control., February, 1969


  Loading...