Theoretical Computer Science
Sylvain's user avatar
Sylvain's user avatar
Sylvain's user avatar
Sylvain
  • Member for 13 years, 1 month
  • Last seen more than a week ago
Profile Activity
Stats
3,334
reputation
78k
reached
38
answers
1
question
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
26
silver badges
22
bronze badges
Top tags
View all tags
155
Score
16
Posts
41
Posts %
94
Score
10
Posts
26
Posts %
92
Score
12
Posts
31
Posts %
62
Score
6
Posts
15
Posts %
60
Score
8
Posts
21
Posts %
38
Score
3
Posts
8
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
24
Can all unambiguous grammars be parsed in linear time?
Mar 2, 2012
answer
19
Known algorithms to go from a DFA to a regular expression
Dec 1, 2011
answer
19
Ambiguity in regular and context-free languages
Sep 22, 2013
answer
15
Ackermann Function Time Complexity
Oct 20, 2014
answer
15
Novel proof of pumping lemma for regular languages
Apr 1, 2016
answer
13
Translation of context-free parsing into SAT
Mar 6, 2015
answer
13
Lipton's most influential results
Sep 17, 2014
answer
12
Closure of unambiguous context-free languages under pre- and postfix.
Mar 22, 2011
answer
11
What are the prospects of research in database field?
Nov 14, 2010
answer
11
Automated theorem proving in linear logic
Jan 28, 2014
Top network posts
View all network posts
5
What ordinal corresponds to the T(3)?

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.