[an error occurred while processing this directive]
Case-Study Session
Introduction to L-systems and Their Applications to Plant Growth Modeling
by
Girish Palshikar
Tata Research Development and Design Centre
(a division of Tata Consultancy Services)
Saturday, 28 March 2009, 10:30 AM–1:00 PM
CMS classroom on the first floor of the
Department of Computer Science
Abstract Strings are sequences of symbols from a finite alphabet. A grammar is a set of rules for string rewriting. The well-known Chomsky hierarchy consists of different types of grammars (regular, context-free, context-sensitive and type-0) obtained by imposing specific restrictions on the format of the rewrite rules. Formal Language Theory has obtained deep results about grammars. Grammars have been widely used in areas such as compilers, program verification, linguistics, natural language processing and bioinformatics. In Chomskian grammars, only one symbol is rewritten (using one rule) in one step of string rewriting. L-systems are a generalization where all symbols in the string are rewritten in one step. We begin with a brief overview of Chomskian grammars. We then introduce various types of L-systems and their applications to modeling various aspects of plant growth.
The Speaker Girish Palshikar has an M.S. (Computer Science and Engineering) from Indian Institute of Technology, Madras (Chennai) and an M.Sc. (Physics) from Indian Institute of Technology, Bombay (Mumbai). Since 1992, he is working as a Scientist at the Tata Research Development and Design Centre (TRDDC), Pune, India. His research interests are in Machine Learning and Theoretical Computer Science. He is also a Visiting Faculty at the Computer Science Department, Pune University, Pune, India.
[an error occurred while processing this directive]