Computer Science
jmad's user avatar
jmad's user avatar
jmad's user avatar
jmad
  • Member for 11 years, 9 months
  • Last seen more than 1 year ago
Profile Activity
Stats
9,438
reputation
715k
reached
81
answers
1
question
Communities
View all
About

I play with functions and processes.

Badges
View all badges
1
gold badge
37
silver badges
41
bronze badges
Top tags
View all tags
385
Score
24
Posts
29
Posts %
324
Score
16
Posts
20
Posts %
178
Score
5
Posts
6
Posts %
111
Score
5
Posts
6
Posts %
110
Score
7
Posts
9
Posts %
86
Score
9
Posts
11
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
108
How to convert finite automata to regular expressions?
Jun 16, 2012
answer
73
How to prove that a language is not context-free?
Mar 13, 2012
answer
73
Find median of unsorted array in $O(n)$ time
May 20, 2012
answer
32
How to convert finite automata to regular expressions?
Jun 16, 2012
answer
28
How to convert finite automata to regular expressions?
Jun 16, 2012
answer
21
Decide whether a context-free languages can be accepted by a deterministic pushdown automaton
May 21, 2012
answer
19
Rule of thumb to know if a problem could be NP-complete
May 15, 2012
answer
18
How hard is counting the number of simple paths between two nodes in a directed graph?
Mar 17, 2012
answer
17
Counting sort on non-integers - why not possible?
Nov 12, 2012
answer
17
Characterization of lambda-terms that have union types
Mar 7, 2012
Top Meta posts
1
3
4
How to capture all levels of difficulty
Top network posts
View all network posts
23
Sum of two periodic functions is periodic?
12
Traduction de « to make sense »
9
Result of the product $0.9 \times 0.99 \times 0.999 \times ...$
5
Bounded simulations between Bernoulli distributions
5
Scott continuity on powerset

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.