StackRating

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

Peter Leupold

Rating
1495.70 (4,240,387th) 		Reputation
1,011 (153,524th)
Page: 1 2
Title Δ
How to create a pushdown automata which accepts a language? 0.00
Proof semidecidable languages 0.00
Give a regular expression over Σ = {a,b}...? 0.00
Expressing a Stack ADT with a Finite State Machine Diagram 0.00
Complement and finding substring using Turing Machine 0.00
How can I tell that a language is context-free from first sight? 0.00
W(WR)* regular? 0.00
Linear grammar exercise 0.00
regular languages/expressions capturing all numbers in exponential... 0.00
Regular language closure under insertion 0.00
Can a Finite Automata exist without any final state? -0.32
Need help in generating a CFG for a language 0.00
check if regular language given CF grammar 0.00
Can the halting prοblem be sοlved for certain finite functions? 0.00
Context Free capable of generating all regular languages? +0.31
deterministic finite automation ending with 00 or 11 0.00
Finite Automata 0.00
Infinite union of regular language 0.00
how can i get weighted finite automaton? 0.00
Why the following language satisfies the pumping lemma for cfl 0.00
Is this by Ardens Lemma? | Finite Automata 0.00
Proof a language is not regular using Pumping Lemma 0.00
{<M> | M is TM that accept 3 words } (|L(M)|=3) 0.00
pushdown automaton give strings over alpha, beta and gamma 0.00
What does this mean "In the RAM model of computation, instruct... 0.00
Chomsky Normal Form Conversion Algorithm +3.95
decidable languages (Computational Models) 0.00
Markov algorithm to compute f(x)=x/2 0.00
Are there any Recursively Enumerable problems that are not RE-hard? 0.00
What formalism doesn't belong and which are more powerful/equal 0.00
combination of rectangles, puzzle 0.00
Consequences of the Recursion Theorem 0.00
How to show with the following conditions that the language L isn&#... 0.00
construct an FA (theory of automata) 0.00
Compliment of Deterministic Context Free Language 0.00
How can I find the closure of a D FA 0.00
How to shift data in turing machine? 0.00
Will L = {a*b*} be classified as a regular language? -4.04
What's the difference between dovetailing and concurrency? -1.95
Theory of Computation. Turing Machine 0.00