StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
Prove that a DFA over binary alphabet with k states can recognise a maximum of k^(2k +1) * 2^k langu
| Author | Votes | Δ |
|---|---|---|
| Daniel Martin | 1 | 0.00 |
Last visited: Feb 22, 2016, 11:32:36 PM