Category: Uncategorized

Problem Detail: Can the set of states Q be empty by definition? I was wondering about this question when doing exercises in the pumping lemma for finite automaton. Asked By : user8272 Answered By : Shaull In a DFA – no, because the Read More …

Problem Detail: Below is a well-known equation for generalized recurrence relation in a divide and conquer paradigm (as described in CLRS) — $$T(n) = aT(n/b) + f(n), quad text{where} quad a gt 1 text{ , } b geq 1$$ If we Read More …

Problem Detail: I went through a question asking me to categorize the following grammar. $$S → AA, S → AB, A → a, A→BB, B → b, B → e$$ From the production rules, clearly it is Context-Free. But it accepts Read More …

Problem Detail: What is the complexity of the follwoing recurrence? $$T(n) = T(n-1) + 1/n$$ I highly suspect the answer to be $O(1)$, because your work reduces by $1$ each time, so by the $n$th time it would be $T(n-n) = Read More …

Problem Detail: The question is pretty much in the title. Is there ever a time where some language $L$ can be accepted by a minimal DFA with $n$ states, but $L^R$, the reversal of $L$, can be accepted by a DFA Read More …

Problem Detail: I want to prove that $E subsetneq EXP$ and i would like to do so using the Time Hierarchy Theorem I need to choose $f(n)$, i think $2^{cn}$ is a good choice, so here is my Proof: $Esubseteq TIME(2^{cn})$ Read More …

Problem Detail: I understand how you can use a contradiction in regard to a DPDA to show a language has finitely many Myhill-Nerode equivalence classes, but what is the method used to show each string of a language accepting palindromes is Read More …

Problem Detail: How can we ensure that we are continuing to make sound and valid statements about complexity classes when using oracle Turing Machines? According to my understanding (based on the definitions given in introductory textbooks on the subject) oracle Turing Read More …

Problem Detail: I was solving exercises on Lambda calculus. However, my solutions are different from the answers and I cannot see what is wrong. Find free variables of $(lambda x.xy)x$. My workings: $FV((lambda x.xy)x)=FV(lambda x.xy) cup FV(x)={y} cup {x}={x,y}$. The model Read More …

Problem Detail: This question stems from a few answers and comments on a question I posted in signal processing found here. I guess I am a little confused. Are there any concrete differences between realtime software/hardware and just a regular PC? Read More …