Stack Exchange
log in
chat
meta
about
Stack Exchange
All Sites
Hot Questions
Top Users
Newsletters
Blogs
Numerator
top
accounts
reputation
activity
favorites
subscriptions
Top Questions
12
votes
Is { w | w <> w^R } over the alphabet {0,1} a context-free language?
context-free-grammar
computation-theory
asked Mar 27 '12 at 8:27
stackoverflow.com
10
votes
Observable in Java
java
oop
design-patterns
observer-pattern
asked Sep 1 '11 at 13:30
stackoverflow.com
8
votes
Getting the length of two-dimensional array
java
arrays
asked Sep 9 '11 at 20:42
stackoverflow.com
7
votes
Continued fractions
number-theory
continued-fractions
asked Apr 19 '12 at 6:41
math.stackexchange.com
7
votes
Proof that $\{⟨M⟩ ∣ L(M) \mbox{ is context-free} \}$ is not (co-)recursively enumerable
formal-languages
computability
context-free
turing-machines
asked May 21 '12 at 19:28
cs.stackexchange.com
7
votes
Prove or refute: BPP(0.90,0.95) = BPP
complexity-theory
time-complexity
probabilistic-algorithms
asked Jan 7 at 21:40
cs.stackexchange.com
6
votes
The syntax <T extends Class<T>> in Java
java
generics
syntax
asked Sep 2 '11 at 11:21
stackoverflow.com
6
votes
Show that the halting problem is decidable for one-pass Turing machines
formal-languages
computability
turing-machines
check-my-proof
asked Jun 3 '12 at 14:32
cs.stackexchange.com
6
votes
Is SAT in P if there are exponentially many clauses in the number of variables?
complexity-theory
np-complete
reductions
satisfiability
polynomial-time
asked Jul 12 '12 at 8:19
cs.stackexchange.com
5
votes
Java- why does it print null?
java
runtime
asked Sep 6 '11 at 13:08
stackoverflow.com
1
2
next
Top Answers
No answers with score of 5 or more
Stack Exchange works best with JavaScript enabled