IgnouGroup Social Campus
Problem Detail: I’m studying LR(0) parser. But I don’t understand how sets of items corresponding to states can be calculated. I think The author would miss some information readers must know. Given the following LR(0) automaton, How the set of items Read More …
Problem Detail: On the wikipedia page here it describes pretty well the CDCL algorithm (and it seems the pictures were taken from slides created by Sharad Malik at Princeton). However when describing how to backtrack all it says is “to the Read More …
Problem Detail: I had a homework assignment where I had to build a PDA over the alphabet ${a,b}^*$, accepting $L = {x mid x text{ is even but not a palindrome}}$. I already turned it in, but I know I had Read More …
Problem Detail: I have a $n times m$ rectangular grid of cells, and a set $R$ of rectangles within this grid. Each rectangle is a subset of the cells. (Alternatively, you can think of them as axis-aligned rectangles where each of Read More …
Problem Detail: I’m looking into various SAT-solvers and trying to understand how they work and why they are designed in certain ways. (But I’m not in a university at the moment and I do not know anyone who is a professor. Read More …
Problem Detail: Could a Universal Turing machine be set up so that it is able to ‘reprogram’ itself to ‘behave’ like any specific Turing machine without using some ‘outside’ source of info to cause it to do this? Asked By : 201044 Read More …
Problem Detail: I’m looking for an explanation or reference on the implementation of computer clock. To keep the question at the level of logical abstractions: say, we put together some combinational and sequential logic from basic gates. The role of the Read More …
Problem Detail: I am wondering if deciding the decidability of problem is a decidable problem. I am guessing not, but after initial searches I cannot find any literature on this problem. Asked By : sync Answered By : Rick Decker Major edit of Read More …
Problem Detail: Here’s the code for the algorithm: Foo(n) lcm = 1 for i = 2 to n lcm = lcm*i/Euclid(lcm,i) return lcm The running time of Euclid$(a, b)$ is given as $O(log(min(a, b)))$ So the running time of the for Read More …
Problem Detail: Finding Big-O is pretty straightforward for an algorithm where $f(n)$ is $$f(n) = 3n^4 + 6n^3 + 10n^2 + 5n + 4$$ The lower powers of $n$ simply fall off because in the long run $3n^4$ outpaces all of Read More …
