Blog

Problem Detail: From what I’ve read, Big O is the absolute worst ever amount of complexity an algorithm will be given an input. On the side, Big Omega is the best possible efficiency, i.e. lowest complexity. Can it be said then Read More …

Problem Detail:  Problem : Given a (one dimensional) row containing $2N$ tiles arranged in $2N + 1$ spaces. There are $N$ black tiles (B), $N$ white tiles (W), and a single empty space. The tiles are initially in an arbitrary Read More …

Problem Detail: CPU caches are used by exploiting temporal and spatial locality. My question is who is responsible for managing these caches? Is this Operating system that identifies a particular access pattern and then manages (i.e store the data in) cache, Read More …

Problem Detail: Show that for $l(n) = log log n$, it holds that $text{DSPACE}(o(l)) = text{DSPACE}(O(1))$. It’s well known fact in Space Complexity, but how to show it explicitly? Asked By : com Answered By : A.Schulz So here is the main idea Read More …

Problem Detail: I’d love your help with the following question: Let $G$ be context free grammar in the Chomksy normal form with $k$ variables. Is the language $B = { w in L(G) : |w| >2^k }$ regular ? What is Read More …

Problem Detail: Can anyone tell me what is the difference between the following regular expressions: $(0^*1^*)^*$ and $(0+1)^*$ ? To me they look like generating the same string. Asked By : Abhishek Anand Answered By : Ran G. The language of both regular Read More …

Problem Detail: I need help with the following question: Order the following formalisms according to their expressive power: placing A before B means that any language definable by A is definable by B. Also state which, if any, of them are Read More …

Problem Detail: I’m currently reading introduction to algorithms and came by Johnson’s algorithm that depends on making sure that all paths are positive. the algo depends on finding a new weight function (w’) that is positive for all edges and keeps Read More …

Problem Detail:  Background I am learning assistance, Coq, on my own. So far, I have completed reading Yves Bertot’s Coq in a Hurry. Now, my goal is to prove some basic results concerning the natural numbers, culminating with the so-called Read More …

Problem Detail: Given the language $EQ_{dfa} =$ ${<A, B> | A$ and $B$ are two DFAs and $L(A) = L(B)$ $}$ Prove that $EQ_{dfa}$ is decidable by testing the two DFAs on all strings upto a certain size. Calculate a size Read More …