IgnouGroup Social Campus
Problem Detail: I have been developing a GA for one of the projects I’m working on. I have everything implemented with no problems and I really like how GAs work in general, it’s a really cool and relatively new concept. However Read More …
Problem Detail: A directed graph is said to be unipathic if for any two vertices $u$ and $v$ in the graph $G=(V,E)$, there is at most one simple path from $u$ to $v$. Suppose I am given a unipathic graph $G$ Read More …
Problem Detail: In the script I am currently reading on the lambda calculus, beta equivalence is defined as this: The $beta$-equivalence $equiv_beta$ is the smallest equivalence that contains $rightarrow_beta$. I have no idea what that means. Can someone explain it in Read More …
Problem Detail: Recently I found in a paper [1] a special symmetric version of SAT called the 2/2/4-SAT. But there are many $text{NP}$-complete variants out there, for example: MONOTONE NAE-3SAT, MONOTONE 1-IN-3-SAT, … Some other variants are tractable: $2$-$text{SAT}$, Planar-NAE-$text{SAT}$, … Read More …
Problem Detail: Looking for insight into decisions around garbage collected language design. Perhaps a language expert could enlighten me? I come from a C++ background, so this area is baffling to me. It seems nearly all modern garbage collected languages with Read More …
Problem Detail: I know from Sedgewick’s book on algorithms that the max depth of any node x from a set of N nodes is at most log2(N) applying the algorithm(which says to put the shorter tree beneath to avoid tall trees) Read More …
Problem Detail: I have a regular language consisting of such {0,1}^k sequences, in which every subsequence of length 5 has at least two 0’s in it (which also means every sequence of length <5 is ‘good’). I need to find a Read More …
Problem Detail: I’m having a problem understanding this conversion. Let’s say we have a CFL like this: $ { a^nb^m : n > m } $ A final state acceptance PDA for this language would push $A$ symbols in the stack Read More …
Problem Detail: We have operator and operands, function and formal arguments. Is the difference purely lexical (we use alphanumerics for funciton identifiers but identify operators with special characters, e.g. “+” and “>=”) or it is syntactical, like I guessed here f(a,b) Read More …
Problem Detail: I read a quotation attributed to Sheila Greibach that says that the intersection of two context free grammars is recursively enumerable. I could not, however, find a citation for this quotation (and searching has failed to turn up a Read More …
