StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
How to prove language L is not regular? L = {a^3^k | k element N} is subset of {a,b}*
Author | Votes | Δ |
---|---|---|
Blindy | -1 | 0.00 |
Last visited: Jan 2, 2016, 3:59:50 AM