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 ... 6 7 8 9 10 ... 24

Title	Δ
How to prove this set equivalence	0.00
How to design a context free grammar that avoids repetition?	-1.06
Questions about regular expressions	0.00
Nondeterministic finite acceptors basic question	0.00
How to show formula for variables	+0.40
An algorithm to solve the postage stamp problem recursively	+0.25
Regular expression [ 1 ( 0 1* 0)* 1 ]* DFA	-0.01
State Diagram for Turing Machine to compute next string in lexicogr...	0.00
Prove that the following languages are equivalent	0.00
Generating context-free grammar from language	0.00
How to find the grammar for a language where one symbol is not repe...	+0.47
Turing Machine to Accept String from a 3 character alphabet	0.00
How do I make this even? L = {w ∈ {0, 1}* \| n0(w) = 2n1(w) and \|w\|...	0.00
How to convert this automata to regular expression via NFA	+0.38
Algorithm that can compute values of variables based on the result...	0.00
CFG of Language which contains equal # of a's and b's	0.00
Can 2 for loops be run simultaneously, looping one after the other?	+0.06
Regularity of a language With pumping Lemma	0.00
How can I convert this ambiguous grammar to non-ambiguous grammar?	0.00
Result of multiplying both sides of not-big-O relationship by the s...	0.00
"How to make a turing machine of {w ∈ {a,b}∗ \| 2na(w) = 3nb(w)...	0.00
If the string of L consists of 0's only prove that L* is regular	0.00
polynomial-time mapping reductions for NP	0.00
Is there a non-RE language that is composed of only 1 element?	0.00
Finding nondeterministic finite automaton language	0.00
What is the complexity of an algorithm: T (n) = 3 * T (n ÷ b)...	0.00
PDA and a regular expression	0.00
determine Big-Oh / Big-Theta or Big-Omega	0.00
PDA for L = {a^nb^m : m ≥ n, m-n is even}	0.00
Given Two Regex, Determine if One is a Complement of Other	+0.49
Equivalence between regular expressions	-0.01
What structure or mechanism can I use to generate a LaTeX interpret...	0.00
Construct a grammar over {a,b} whose language is	+0.94
Can someone help me Convert Grammar to regular expresion	0.00
Print either True or False	-0.08
Generate random numbers with different digits	-0.53
Function which increases fast and slows down reaching predefined ma...	0.00
Computational complexity for regular expressions	-0.49
If L1 and L2 are non regular languages, prove or disprove that L1 U...	0.00
Is bin(n)bin(2^(k+1) * n + 1)^R context free?	-1.33
Dividing players into "winners" and "losers": h...	-1.59
Regex \| Containing "bbb"	+0.49
If M is a turing machine, the question if L(M) = A Regular Language...	+2.69
Is it correct O(n!)=O((n+1)!)?	0.00
Constructing deterministic finite automaton equal to a nondetermini...	0.00
How can I find regular grammar for L* if we are given a grammar for...	0.00
Formal language theory (regular expressions and regular languages)...	-0.00
Build grammar to the language	0.00
Turing machine: such that for every word w in {a,b}*, it will chang...	-2.16
How and why non deterministic PDA is more powerful than determinist...	0.00