StackRating
An Elo-based rating system for Stack Overflow
Answers and rating deltas for
Need to prove language L = {a^nb^m: n < m < 2m} is not regular
| Author | Votes | Δ |
|---|---|---|
| Patrick87 | 1 | 0.00 |
Last visited: Jan 14, 2019, 5:44:52 AM