A rose by any other name would smell as sweet

Speaker : Jaikrishnan Janardhanan

Date : 9th April, 2014 (Wednesday)

Time : 09:00 pm – 10:00 pm

Venue : Lecture Hall I, Department of Mathematics

Abstract : I shall talk broadly about Formal Languages, Grammars, and Automata. I will define these terms rigorously, and I shall give a brief proof of the fact that regular expressions and finite-state automata have the same expressive power.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s