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 ... 13 14 15 16 17 ... 24
Title Δ
Big Oh,small Oh and Big theta relations 0.00
Could you say that (n lg n) is O(n^2)? -1.99
Calculating the time complexity 0.00
What is the pattern? 0.00
Print all nodes accessible by at least two paths using DFS +0.49
Turing machine for palindrome 0.00
Definition of a language in Automata Theory 0.00
Given a file how to generate an NFA that accepts only those words p... 0.00
Can't demonstrate why !A&B OR !A&C OR !C&B = !C&... +0.04
Context Free capable of generating all regular languages? -0.04
is it possible to write a program that can find zeros of a certain... 0.00
Implementing cartesian product, such that it can skip iterations 0.00
Creating a diagram for a PDA that recognizes each L 0.00
Preprocess shortest paths under contention 0.00
Union and intersection of two languages 0.00
Hash function for string with complexity O(N) -1.31
Will this program halt -0.04
time/space complexity for .net intersect() method +1.78
How can I construct a grammar that generates this language? grammar... -0.04
DFA for a Tic Tac Toe Game 0.00
How long would it take to run an algorithm with 10-100 quadrillion... +0.44
Algorithm to check overlap between arrays +0.31
Unrestricted Grammar: { sss | s exists in {a,b}* } 0.00
Discrete Math Big O Notation 0.00
Pumping Lemma - non regular 0.00
Start state for a DFA in Automata +0.47
g-sorted-ness is not affected by later h-sorting : is proof correct? 0.00
How to show that if the language L is regular, then L' is regul... 0.00
How L={wxw^R| w, x belongs to {a,b}^+ } is a regular language 0.00
Construct a context free grammar for a language in Chomsky Normal F... 0.00
Prove whether this language is decidable or undecidable 0.00
Turing machine to compare binary 0.00
Pushdown Automation with unequal elements 0.00
Regular Languages 0.00
Time complexity for: do all paths between node A and node B interse... 0.00
running .bat in powershell script without opening any windows 0.00
what will be time complexity of relation T(n)=nT(n-1)+n +0.01
Write regular expressions for the following languages over the alph... 0.00
Construct grammar for the following languages 0.00
Don't seem to get the speedup I should in openMP +2.50
Trying to use Math.floor to round numbers but it doesn't cut th... -2.29
Basic C++ inheritance. +1.65
Is it safe to create a vector with new? -0.58
memset bytewise instead of integer ( 4 bytes ) -0.14
Proving the correctness of a program 0.00
Context-free grammar to generate L = { ω ∈ (0 ∪ 1)* } +0.47
Is it a right way to find the regular grammar by construct an DFA? -1.88
What is the number of states in the minimal DFA with input symbols... -0.03
How to write a CFG with functions? 0.00
Merge collided bodies as one +1.74