Category: Uncategorized

Problem Detail: So I have grouped the following formalisms into a power hierarchy (and made classes for them): Class 1 DFA NFA NFAϵ reg.exp Class 2 (DCFL expressivity?) LR(1) DPDA Class 3 CFG PDA Class 4 TM NTM Class 4 is Read More …

Problem Detail: I am trying to define a Odd Parity Function that takes three 1 bit inputs and will output a 1 if the 3 bits are odd as a Boolean function. 1 1 0 = 0 1 0 0 = Read More …

Problem Detail: The problem, coming from an interview question, is: You have a stream of incoming numbers in range 0 to 60000 and you have a function which will take a number from that range and return the count of occurrence Read More …

Problem Detail: So, I have a list of cities (A, B, C, etc) with weighted edges (two-way, undirected) between them with a list of cities that already have a store. My task is to place a one new store at either Read More …

Problem Detail: Is it practically possible or even near possible to make parity game to be solved in polynomial time? If yes, how? and if No, why? Asked By : Andy Answered By : Shaull Parity games are famously known to be in Read More …

Problem Detail: According to my understanding, a Turing machine that’s valid has to have finite steps to finish a certain step. If this is right, what else determines the validity of a turing machine? Asked By : Shelby. S Answered By : Jonathan Read More …

Problem Detail: I am a little bit confused by the definition of dominant strategy and winning strategy, what’s the difference between them. Following are the definitions taken from wikipedia, below every definition I added some thoughts. If you fell that my Read More …

Problem Detail: I don’t understand why $n log log n $ is not $Theta (n)$. Suppose we give $n$ a value of $10,000$. Then $n log log n$ is $6020.6$. So isn’t $n log log n$ upper- and lower-bounded by $n$, Read More …

Problem Detail: $T(n)=2T(n/2) + nlog^2(n)$. If I try to substitute $m = log(n)$ I end up with $T(2^m)=2 T(2^{m-1}) + 2^mlog^{2}(2^m)$. Which isn’t helpful to me. Any clues? PS. hope this isn’t too localized. I specified that the problem was a Read More …

Problem Detail: Is there a rule that either every DFA contains or not, a loop(cycle in graph terminology)? I do not seem to be able to generalize this idea in either direction. Also if either of these is true, can we Read More …