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 ... 7 8 9 10 11 ... 24
Title Δ
Generate a CFG for a list of words 0.00
Why finite automatons are defined with help of tuple? Like DFA can... 0.00
Automata to regular expression 0.00
Showing that the intersection of two language accepted by NFA is un... 0.00
How to design a Turing machine which checks whether a number is pri... 0.00
Something is not computable, can it be co-recursively enumerable? 0.00
I want a curriculum to study computer science 0.00
Determining whether the following language is decidable 0.00
Pumping lemma for CFL 0.00
Describe the language generated by this context-free grammar +0.50
Boolean Logic and Truth Tables 0.00
Please help me covert the dfa to regular expression 0.00
Describe a Pushdown Automata for this language 0.00
Can a Directed acyclic graph have zero edges? 0.00
Can a Turing complete language ever have a CFG? 0.00
Show that the language L = {w ∈ {0, 1} ∗ | Mw(x) ↓ for an input x}... 0.00
How do you determine if a language is regular, context free but not... 0.00
Role of automata in Compiler Construction 0.00
Build enumerator (printer) for { 0 ^ (3 ^ n) | n >=0} with at mo... 0.00
Regular expression over the language C={a,b} 0.00
Context Free Grammar, range of numbers 0.00
How to organize 10.000s of tables of different size in a SQL database 0.00
I need help on proves about automata 0.00
Prove the language is not context-free? 0.00
DFA over language {0,1} 0.00
Why is figuring out if the cardinality of a language is not finite... 0.00
Prove that the languages are not context free? 0.00
Simplify a typical(?) conditional construct 0.00
Tokens in a bag -1.72
When 2 computer interact over a network connection then first they... 0.00
implement random 0 1 with custom parameter -1.09
Need to prove language L = {a^nb^m: n < m < 2m} is not regular 0.00
Inductive Proof of Counting Sort? 0.00
PDA to accept language with more a's than b's and c's 0.00
The Mathematical Relationship Between Big-Oh Classes -0.96
Do both of these regular expressions 0.00
Converting ambiguous language to unambiguous +1.87
Possible ways to keep the sequence of an array -0.13
How can I speed up my integration program in python? 0.00
How to simply (AB')' or (ABC')'? -1.37
String length after kleen's closure in finite-autometa theory 0.00
Nondeterministic Finite Automata construction 0.00
Converting to First order logic 0.00
How would you answer this question using quantifiers, and logical o... 0.00
Encoding a number with a suffix or prefix in a compact way -0.76
How to construct a PDA for n(a) is less than or equal to 2n(b) 0.00
Show that, for any languages L1 and L2, we have (1). L1L1^* = L1^*L... 0.00
How Can I Tell if a DFA Accepts an Empty String? 0.00
How to determine if one regex is subset of another? 0.00
complexity class of functions -0.08