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 2 3 4 5 ... 24
Title Δ
First-order logic question: Which one is the translation of “John h... 0.00
What is the language accepted by the PDA shown below 0.00
Function to convert binary tree to full Binary tree? -2.13
Time complexity of nested loop where the second loop iterates only... 0.00
Construct pushdown automata 0.00
Error CS0535: 'CMTaskPriorityRepository' does not implement... 0.00
Counting Sort has a lower bound of O(n) +1.00
What are the theoretical upper limits on parallelizability? 0.00
I ask for help in areas I don't know when I study programming l... 0.00
Convert context free grammar to regular grammar 0.00
Algorithm to find the m smallest numbers in a list of n numbers +0.48
Algorithm to all N words in a language 0.00
Given 1 billion numbers we need to find the largest 1 million numbers -0.51
Determining if a point lies between two bearings from a central point +2.10
Will my server be able to run only one client if its a single-threa... 0.00
Asymptotic bounds and Big Θ notation 0.00
Time Comp: Why is a single for loop with three assignment statement... 0.00
PDA to Turing machine conversion 0.00
Pushdown automata to accept the following language 0.00
How L = {a^n b^m | n,m>=1, n != 3m} is not regular? +3.04
If a problem A ≤p B, then that B ≤p A, prove or disprove 0.00
Determine time complexity of arithmetic progression 0.00
proof L = {a^n b^m | n>=m} is irregular language 0.00
What is the time complexity of below geometric series? +0.49
Show that the class of decidable languages is closed under the oper... +0.00
can any context free grammar be recognized by a non deterministic p... 0.00
Automata and Computability 0.00
find all 256 cases of 2 numbers in array of 8 length 0.00
Checking whether a function is computable or not 0.00
infinite regular language and finite regular language proof +0.65
Proof of closure of asymptotically bounded functions under addition 0.00
NFA to accept the following language 0.00
Construct a DFA which accept the language L = {w | w ∈ {a,b}* and N... 0.00
Can a problem be in NP but not NP-Complete or P? 0.00
Construct CFG from {w element of {a, b}* : 2#a(w)=3#b(w)} 0.00
How to Pumping lemma for Regular language 0.00
Counting and Complexity for Password Possibility 0.00
Find all non co-linear points 0.00
Deterministic Pushdown automa vs Non-deterministic pushdown Automata 0.00
Regex to Finite Automata -1.24
How to define or name the function F(n) = n + (n-1) + (n-2) ... + 1 -0.51
How to find the language of a NFA 0.00
Inserting a regular language into other regular language 0.00
Is the Language L := {a^nb^nc^n | n >= 1} in P? 0.00
how to determine time complexity of any program? 0.00
Solving and proving a DFA that subtracts and takes the modulus of t... 0.00
Math - Percentage to Range Conversion 0.00
Polynomial time algorithm for computing the size of the DFA describ... 0.00
Regular Expression All strings where the number of b’s can be evenl... 0.00
Is this an example of logarithmic time complexity? 0.00