Badge
| Nice Answer | Answer score of 10 or more. This badge can be awarded multiple times. |
jmad earned this badge 10 times |
feb 6 at 16:20
Characterization of lambda-terms that have union types
jan 16 at 20:38
Are Turing machines more powerful than pushdown automata?
jan 14 at 15:48
How hard is counting the number of simple paths between two nodes in a directed graph?
nov 13 at 7:16
Counting sort on non-integers - why not possible?
sep 26 at 0:49
When are two simulations not a bisimulation?
jun 27 at 16:21
Decide whether a context-free languages can be accepted by a deterministic pushdown automaton
mar 29 '12 at 7:03
How to prove that a language is not context-free?
mar 23 '12 at 21:21
Random Sudoku generator
mar 22 '12 at 16:50
Is there a difference between $\lambda xy.xy$ and $\lambda x.\lambda y.xy$?
