Издательство World Scientific, 2006, -420 pp.
This volume of contributed papers commemorates the 75th birthday of Prof. Rani Siromoney, one of the foremost theoretical computer scientists in India and a leading authority on Formal Languages and Automata Theory. Over a period spanning four decades, she has made tremendous technical contributions to the field through her research. She has also inspired generations of students in Chennai with her teaching and has been responsible for building up a community of dedicated teachers and researchers in this part of India to carry forward her vision.
Prof. Siromoney has served on the Editorial Board of the jouals Theoretical Computer Science and Inteational Joual of Foundations of Computer Science and has headed several inteational collaborative research projects. She also served on the Programme Committee for the first ten editions of the inteational conference Foundations of Software Technology and Theoretical Computer Science, one of the leading theoretical computer science conferences in the world. She is currently Professor Emeritus at Madras Christian College, the illustrious institution where she has spent most of her professional life. She continues to play an active role in research and teaching as Adjunct Professor at Chennai Mathematical Institute.
The contributions in this volume span a wide range of subjects, thematically connected by the use of concepts from formal languages and automata theory. The areas explored in this volume include compiler construction, computational complexity theory, formal modelling of concurrent systems, codes and image analysis. The contributors are leading researchers in computer science from all parts of the world, all of whom have been associated with Rani Siromoney during the course of her long and productive career.
Finite Array Automata and Regular Array Grammars
L-Convex Polyominoes: A Survey
On Oriented Labelling Parameters
On a Variant of Parallel Communicating Grammar Systems with Communication by Command
Some Remarks on Homogeneous Generating Networks of Free Evolutionary Processors
Hexagonal Contextual Array P Systems
A q-Analogue of the Parikh Matrix Mapping
Contextual Array Grammars
Characterizing Tractability by Cell-Like Membrane Systems
A Cosmic Muse
Sublogarithmically Space-Bounded Alteating One-Pebble Turing Machines with only Universal States
Verification of Clock Synchronization in TTP
Triangular Pasting System
Towards Reducing Parallelism in P Systems
Iteration Lemmata for Rational, Linear, and Algebraic Languages Over Algebraic Structures with Several Binary Operations
The Computational Efficiency of Insertion Deletion Tissue P Systems
Petri Nets, Event Structures and Algebra
Patte Generation and Parsing by Array Grammars
Anchored Concatenation of MSCs
Simple Deformation of 4D Digital Pictures
Probabilistic Inference in Test Tube and its Application to Gene Expression Profiles
On Languages Defined by Numerical Parameters
An Application of Regular Tree Grammars
Digitalization of Kolam Pattes and Tactile Kolam Tools
Hexagonal Array Acceptors and Leaing
Pollard's Rho Split Knowledge Scheme
Characterizations for Some Classes of Codes Defined by Binary Relations
This volume of contributed papers commemorates the 75th birthday of Prof. Rani Siromoney, one of the foremost theoretical computer scientists in India and a leading authority on Formal Languages and Automata Theory. Over a period spanning four decades, she has made tremendous technical contributions to the field through her research. She has also inspired generations of students in Chennai with her teaching and has been responsible for building up a community of dedicated teachers and researchers in this part of India to carry forward her vision.
Prof. Siromoney has served on the Editorial Board of the jouals Theoretical Computer Science and Inteational Joual of Foundations of Computer Science and has headed several inteational collaborative research projects. She also served on the Programme Committee for the first ten editions of the inteational conference Foundations of Software Technology and Theoretical Computer Science, one of the leading theoretical computer science conferences in the world. She is currently Professor Emeritus at Madras Christian College, the illustrious institution where she has spent most of her professional life. She continues to play an active role in research and teaching as Adjunct Professor at Chennai Mathematical Institute.
The contributions in this volume span a wide range of subjects, thematically connected by the use of concepts from formal languages and automata theory. The areas explored in this volume include compiler construction, computational complexity theory, formal modelling of concurrent systems, codes and image analysis. The contributors are leading researchers in computer science from all parts of the world, all of whom have been associated with Rani Siromoney during the course of her long and productive career.
Finite Array Automata and Regular Array Grammars
L-Convex Polyominoes: A Survey
On Oriented Labelling Parameters
On a Variant of Parallel Communicating Grammar Systems with Communication by Command
Some Remarks on Homogeneous Generating Networks of Free Evolutionary Processors
Hexagonal Contextual Array P Systems
A q-Analogue of the Parikh Matrix Mapping
Contextual Array Grammars
Characterizing Tractability by Cell-Like Membrane Systems
A Cosmic Muse
Sublogarithmically Space-Bounded Alteating One-Pebble Turing Machines with only Universal States
Verification of Clock Synchronization in TTP
Triangular Pasting System
Towards Reducing Parallelism in P Systems
Iteration Lemmata for Rational, Linear, and Algebraic Languages Over Algebraic Structures with Several Binary Operations
The Computational Efficiency of Insertion Deletion Tissue P Systems
Petri Nets, Event Structures and Algebra
Patte Generation and Parsing by Array Grammars
Anchored Concatenation of MSCs
Simple Deformation of 4D Digital Pictures
Probabilistic Inference in Test Tube and its Application to Gene Expression Profiles
On Languages Defined by Numerical Parameters
An Application of Regular Tree Grammars
Digitalization of Kolam Pattes and Tactile Kolam Tools
Hexagonal Array Acceptors and Leaing
Pollard's Rho Split Knowledge Scheme
Characterizations for Some Classes of Codes Defined by Binary Relations