Inventor of linear runtime suffix tree construction, e.g. for solving longests common substring in linear runtime, which Knuth claimed impossible three years before...
Panini gives formal production rules and definitions to describe Sanskrit grammar. ... The construction of sentences, compound nouns etc. is explained as ordered rules operating on underlying structures in a manner similar to modern theory.