Talks
Fall 2015
![](https://old.simons.berkeley.edu/sites/default/files/styles/workshop_main/public/complexity_logo_final.png?itok=bgRCs3HD)
Playing with Grammars: What Have We Known So Far!
Tuesday, December 1st, 2015, 9:15 am–10:00 am
Given a context free language, and an input string, language edit distance measures minimum number of insertions, deletions and substitutions required to map the string to any valid member of the language. In this talk, I will tell you what I have learnt playing with this problem: upper bounds, lower bounds, and their implications.