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 ... 4 5 6 7 8 ... 24
Title Δ
Asymptotic complexity of a simple pseudocode function 0.00
Need help understanding this proof (computer science) 0.00
What is the "Regular Expression" for this given machine? 0.00
What is the right way to translate the computation time on one devi... 0.00
Can the unreachable state removed in this minimized DFA? 0.00
What is the simplified boolean expression for A+A`B`? 0.00
Find Context Free Grammer for the following 0.00
Turing Machine, Strings and Sub-String 0.00
What is the time complexity of finding a letter in a string? 0.00
Can the intersection of two regular languages be non-regular? 0.00
Subgame Perfect Nash Equilibrium 0.00
I have 10 variables and I have to fill them with either 1 or -1 , h... -0.71
Graph where BFS tree and DFS tree are different for every node 0.00
Whether a context free language is deterministic context free langu... 0.00
(T/F and explain) An NFA accepts the empty string if and only if it... 0.00
(T/F) Given an NFA that has null/epsilon transitions, one can creat... 0.00
Verify wether the following answer is correct? 0.00
How can i ensure a string has even quotations using automata? -2.03
A human-readable textual representation of a Directed Acycling Graph -0.31
Advice in proving Big O complexities 0.00
Is there any solution for this? 0.00
What is the asymtotic complexity of the following code +0.16
Solve 'x' in this equation when passed variables using C# -0.48
We can directly assign value to any data member. why the use of con... -0.30
How to initialize these pointers? -0.51
Is clock cycle a length of time? -2.34
What is instruction set architecture? -0.22
Add maximum possible edges to the graph with nodes capacity -1.49
Is this a regular language? 0.00
Find all cyclic paths in a directed graph +0.47
What would be the Recurrence Relation for the function and hence it... -0.01
Construct a new DFA B from A where L(B) = L(A) - {w | w∈E* } 0.00
how to construct a dfa that recognizes the set of bit string that b... 0.00
Will I have a smaller time complexity if I use both the head and ta... 0.00
Is this transformation from a NFA to a DFA correct? 0.00
Whether this is the general approach for making a DFA for accepting... 0.00
Prove regular language and automata 0.00
Proving or Refuting Time Complexity 0.00
Is n log n = O(n) and is n log n = Omega(n) +0.21
DFA for strings not containing 101101 as substring +0.00
Is L = {wxw| x, w ∈ {a,b}*} a Regular Language? 0.00
Convert sorted array into low high array +0.32
Regular language for number of A's in the string 0.00
Computational Theory 0.00
Design a Turing machine that calculates the parity of a binary number 0.00
How to find the cycles present (with the vertex no as well ) in an... +0.50
Even distribution of sticks to persons already having sticks 0.00
how do I produce unique random numbers as an array in Python? -0.74
Construct the state diagram for TM 0.00
Find a s-grammar (simple grammar) 0.00