Author: ignougroup

Problem Detail: Every proof I can find of this result is by way of regular expressions. Is there any “constructive” proof that defines the corresponding DFA (probably NFA)? For instance the proof of concatenation closure is most often presented by demonstrating Read More …

Problem Detail: I recently read that it is possible to have arrays which need not be initialized, i.e. it is possible to use them without having to spend any time trying to set each member to the default value. i.e. you Read More …

Problem Detail: A recent question made me think about an obvious approach for circumventing the “algorithm is allowed to do anything” problem, when proving lower bounds. Instead of starting with a simple looking NP-complete problem, start with a powerful looking logical Read More …

Problem Detail: When talking about general data structure design, my lecture notes talk about one of the concerns being cost of operations. As well as the individual cost, it mentions amortized cost. But then it goes on to say: Amortized cost Read More …

Problem Detail:  Strips –Stands for STanford Research Institute Problem Solver (1971). STRIPS Pseudo code – STRIPS(stateListstart, stateListgoals) 1.Set state = start 2.Set plan = [] 3.Set stack = goals 4.while stack is not empty do 1.STRIPS-Step() 5.Return plan STRIPS-Step() switch Read More …

Problem Detail: If I have a sorted array of size $n$, can I build a Red Black tree out of it in $O(n)$ time in a different algorithm rather than splitting the tree in half every time or the straightforward way Read More …

Problem Detail: I take course on Computational Complexity. My problem is I don’t understand Relativization method. I tried to find a bit of intuition in many textbooks, unfortunately, so far with no success. I will appreciate if someone could shed the 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: 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: From Wikipedia about randomized algorithms One has to distinguish between algorithms that use the random input to reduce the expected running time or memory usage, but always terminate with a correct result in a bounded amount of time, and Read More …