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 Δ
Non Deterministic Finite Automata acceptance and Rejection 0.00
How do you divide the string in pumping lemma? 0.00
Converting language to context-free grammar 0.00
Context Free Grammar Design -4.04
Context Free Grammar for Tamarian Language +0.03
How to decide if a language is In R or RE or CoRE 0.00
Is this proof with the pumping lemma (no regular language) ok? 0.00
Mutli-track Turing Machines 0.00
What does it mean to pass the machine and it's description as t... 0.00
Is there any research on parsing in two dimensions? 0.00
Turing machine states design 0.00
How to factorize a string to check its belonging to language that i... 0.00
What does it mean by length of palandrome in theory of automata? ev... 0.00
Proving a decision is undecidable 0.00
Running a UTM on itself and it's description 0.00
how do I show a regular language is equal to another? 0.00
Turing machine that erase its input 0.00
I have seen two questions, and I don't know how to answer this 0.00
About finite automaton's size and number of states 0.00
Turing machine that does not accept - how can we know it? 0.00
Inverse homomorphism of (00+1)* 0.00
How do I construct a formal grammar like that? 0.00
Implement enumerator using turing machine - redundant prints 0.00
Prove that the language is context free 0.00
Why are epsilon transitions used in NFA? +4.13
Automata - Construct NFA using copies of DFA - formal definition of... 0.00
Simulating Non Deterministic Turing machine with Deterministic Turi... 0.00
Proving that a language is not a context free using pumping lemma? 0.00
How exactly do macros in a Turing Machine work? 0.00
Is the language 0^m.0^n , 0<=m<=n regular? 0.00
L = { 1 ^ n (n+1) / 2 } is context free ? 0.00
How to generate syntax tree for a particular sentence like a+b*c wh... 0.00
How to explain the int() function to a beginner +0.03
NFA with k states to accept strings of length <=k +0.23
Understanding the flow of Finite State Transducer 0.00
Prove any DFA with k<2^n states does not accept the strings with... -3.79
Finding DFA of r* when r and DFA of r were deifined 0.00
Can Turing Machine work with decimal numbers? 0.00
find a regular expression where a is never immediately followed by... +1.16
How to construct this turing machine? 0.00
Recursively Decidable language, acceptance of infinite language 0.00
Regular languages and pumping lemma 0.00
Reducibility Etm undecideable 0.00
How to go about constructing turing machines for specific languages? 0.00
Transform NFA to DFA 0.00
Context free grammar for CFL 0.00
Which are the cases where the "pumping lemma" doesn't... 0.00
Can we decide if a number n belongs to a countable set S? 0.00
Turing Machine Configuration 0.00
Union of languages accepted by FSA's without epsilon transitions 0.00