Problem Detail: I am writing somthing about Ppumping Lemma. I know that the language $L = { a^nb^n| n ≥ 0 }$ is context-free. But I don’t understand how this language satisfies the conditions of pumping lemma (for context-free languages) ? Read More …
Author: ignougroup
[Solved]: Does the complement of sigma Kleene star exist?
Problem Detail: If $Sigma^*$ is the set of ALL strings including the empty string, then what can its complement possibly be? The empty set? Asked By : Daniel Baughman Answered By : David Richerby Yes, the complement of all possible strings1 is no Read More …
[Solved]: Intuition behind the Hadamard gate
Problem Detail: I’m trying to teach myself about quantum computing, and I have a decent-ish understanding of linear algebra. I got through the NOT gate, which wasn’t too bad, but then I got to the Hadamard gate. And I got stuck. Read More …
[Solved]: Thompson’s Construction Algorithm produces a different NFA
Problem Detail: My teacher asked me to convert the regular expression $(a | b)^*$ to an NFA using Thompson’s algorithm – well, I’m well aware of how this algorithm works, but since I’m not good at memorising details, I produced a Read More …
[Solved]: How is the complexity of recursive algorithms calculated and do they admit better complexity than non-recursive algorithms?
Problem Detail: How are asymptotical time complexities calculated for recursive algorithms? Recursive algorithms call themselves and therefore take up more space compared to non-recursive algorithms. But are they better taking time complexity into account? If they are better than non-recursive algorithms, Read More …
[Solved]: Is there an equivalent of van Emde Boas trees for ropes?
Problem Detail: Someone I know is planning on implementing a text editor in the near future, which prompted me to think about what kind of data structures are fast for a text editor. The most used structures are apparently ropes or Read More …
[Solved]: What is a partially sorted array?
Problem Detail: I come across this definition but it’s not so clear for me ! An array is partially sorted if the number of inversions is less or equal a constant times the array length. if array length is N then Read More …
[Solved]: What is required for universal analogue computation?
Problem Detail: What operations need to be performed in order to do any arbitrary analogue computation? Would addition, subtraction, multiplication and division be sufficient? Also, does anyone know exactly what problems are tractable using analogue computation, but not with digital? Asked Read More …
[Solved]: Maximum number of augmenting paths in a network flow
Problem Detail: Let’s say we a have flow network with $m$ edges and integer capacities. Prove that there exists a sequence of at most $m$ augmenting paths that yield the maximum flow. A good way to start thinking about this is Read More …
[Solved]: Generating 3SAT circuit for Integer factorization example
Problem Detail: I read somewhere that 3SAT can be used to solve Integer Factorization. If that is true, could someone teach me a simple example of generating the 3SAT by using a small number? Let’s say you are given the number Read More …
