## A Perspective in Theoretical Computer Science: Commemorative Volume for Gift SiromoneyThis volume consists of invited papers written by eminent researchers working in the areas of theoretical computer science. The contents of the papers reflect the current trend of research being carried out in each of the areas. Some of the areas featured are petri-nets, distributed systems, map-generating systems, Lindenmayer systems, logic, cryptography, graph grammars, probabilistic automata, array grammars and pattern recognition. Many of these areas contain open problems and it is hoped that younger research workers will be motivated to work on them. In addition, some of the models designed, constructed and presented are suitable for practical applications such as in computer graphics, cryptography and distributed computing. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Graph Grammars for Map Generation | 3 |

A Note on HDTOL Languages and the Equivalence | 23 |

The Constructive Engine | 38 |

Complexity of Acceptance Problems for Twodimensional | 70 |

Parsing Tree Adjoining Grammars | 95 |

Deterministic Indian Parallel Systems | 121 |

Hexagonal Cellular Automata | 134 |

A Petri Net Model of Asynchronously Communicating | 165 |

### Other editions - View all

### Common terms and phrases

accepted ACSS algorithm alphabet application array grammars array square automaton auxiliary tree Calculus of Constructions cell cellular automata clause Computer Science configuration consider constr constructed context context-free context-free languages corresponding cryptanalysis cryptotext curve decryption defined Definition denoted deterministic edge element encryption equivalence event structure example finite set firing sequences follows function G G G G Y G given graph Hence hexagon input kolam kolam patterns L-systems labelled lambda language Lemma letter Lindenmayer logic programs Madras Christian College matrix morphism necklace neighbors node nondeterministic nonterminal NP-complete parikh vector parsing tree parsing windows Petri nets plaintext poset primitives problem Proof public key cryptosystem recursive relation represents rewriting rough set Rozenberg SLDNF derivation square tapes step string subgoal subset substitution symbols system G Tamil terminal terminal symbols Theorem theory Thue system transition Turing machine turtle U-graph Value variables vertex word