Cryptography, Automata and Learning Theory

D. Gnanaraj Thomas / P. Abisha Jeyanthi.: Department of Mathematics Madras Christian College, Chennai

Foreword


Preface
DNA Computing
RSA Cryptanalysis with Increased Bounds on the Secret Exponent using Less lattice Dimension
Public Key Cryptosystems based on Word Problems
Topologies on Formal Languages
Inference of Tree Grammars using a Pattern Automaton
Some Learning Algorithms based on Fourier Analysis
Watson-Crick Automata and Context-free Languages
Learning Context-free Languages
Symmetric Key Cryptosystems based on Shuffle and Deletion on Trajectories
Some Polly Cracker Public Key Cryptosystems
Applications of L-systems
Tiling Pattern using Pasting Schemes
Splicing Pure Context-free Array Grammar Systems
Splicing P System with Conditional Communication
Learning of Bi-? Languages from Factors
Combinatorics of Subsequences of Finite Words
Parallel Communicating NCE Graph Grammar with Parsability
Graph Grammars for Prefix Recognizable Graphs
A Subclass of Local Languages
Balanced Arrays
Complexity Study of Triangular Arrays
Parallel Communicating Watson-Crick ?-automata System
Ambiguity in Hexagonal Array Contextual Grammars
Note on Unlabeled Finite Graphs: Languages and Classification Reconstruction of Binary Images from Sparse Projections
Learning Parallel Communicating Grammar Systems
Learning 2D Monogenic Pure Context-free Picture Grammars
Reconstruction of 3D-rectangular Array
Organizing Committee
Author Index.