StackRating

An Elo-based rating system for Stack Overflow
Home   |   About   |   Stats and Analysis   |   Get a Badge
Rating Stats for

Patrick87

Rating
1505.77 (126,713th) 		Reputation
18,928 (7,301st)
Page: 1 ... 12 13 14 15 16 ... 24
Title Δ
Context-free grammar for L = { b^n c^n a^n , n>=1} 0.00
Converting regex to a NFA transistion table 0.00
SQL/query string not returning records that I know exist +1.49
Is it a state machine when it works with memory? 0.00
Calculating average case complexity of Quicksort 0.00
NFA to DFA implementation in C++ 0.00
Mutating an array without extra space -0.98
Write a Regex which does NOT contain double letters anywhere (such... -0.15
Need a different permutation of groups of numbers 0.00
classify as regular, context free, or other 0.00
How to prove the correctness of a given grammar? 0.00
What languages are accepted in the PDA 0.00
Algorithm that checks if a context free grammar generates infinite... 0.00
For a context free grammar, how do i convert it to an equivalent pu... 0.00
Sequential logic and readability -0.03
How can a string that does not belongs to the input language can se... 0.00
Regular Language Closure Unconcatenation 0.00
How to calculate number of digits on huge number? C++ +0.05
Algorithm asymptotic-complexity 0.00
Can small growth functions of big-0 be considered larger? 0.00
This NFA to DFA conversion is confusing me 0.00
Sorting biggest and smallest value in array C++ -1.55
Reducing the complexity of class scheduling 0.00
What is the Worst-Case Input for Stein's Algorithm? -1.73
Binary insertion sort and complexity +0.47
Next Greater Even Number -0.51
What's the equivalent of a bug by the Curry-Howard isomorphism? 0.00
Context free grammar for balanced parethesis -1.26
generating numbers using a n-bit number (similar to generating subs... -2.29
Recurrence: T(n)=T(n/2)+ log N -0.05
Algorithm to generate finite language from non-recursive context-fr... +0.19
How can I make DFA of the following condition? -0.04
Odd DFA for Language +0.44
Proving the Big-Theta and other asymptotic definitions (Big-Theta,... 0.00
Is polynomial reduction reversible? -0.30
Context free and regular language with push-down automata and infin... 0.00
Böhm-Jacopini theorem 0.00
PushDown Automaton (PDA) for L={a^(n)b^(n)c^(n)|n>=1} +2.52
Strings that {b U a}* Accepts (Kleene Star) 0.00
Simplification of lambda-productions,unary rules and non-useful sym... 0.00
automata accepting only ba^(n) for n>=1, odd n using 2 states 0.00
How do these two discrete finite automata differ? -0.01
Is there any library for performing an automated reasoning 0.00
Does an NFA necessarily have final states? 0.00
what is exactly the halting in turing machines ? 0.00
How to prove that the union of big theta(g(x)) and small o(g(x)) is... 0.00
How to write the recurrence relation of a pseudocode? +0.47
Calculating Time Complexity for nested loops +0.42
possible concurrent write of *same* value to an integer. Do I need... -0.68
Is the given language Semi-Decidable? 0.00