Apparently, this user prefers to keep an air of mystery about them.
Member for 9 years, 3 months
0 profile views
Last seen Dec 1 '14 at 14:07
Top network posts
- 23 Can all unambiguous grammars be parsed in linear time?
- 19 Ambiguity in regular and context-free languages
- 17 Known algorithms to go from a DFA to a regular expression
- 15 Ackermann Function Time Complexity
- 14 Novel proof of pumping lemma for regular languages
- 13 Lipton's most influential results
- 12 Closure of unambiguous context-free languages under pre- and postfix.
- View more network posts →