IgnouGroup Social Campus
Problem Detail: I was wondering when languages which contained the same number of instances of two substrings would be regular. I know that the language containing equal number of 1s and 0s is not regular, but is a language such as Read More …
Problem Detail: Let $B$ be a boolean formula consisting of the usual AND, OR, and NOT operators and some variables. I would like to count the number of satisfying assignments for $B$. That is, I want to find the number of Read More …
Problem Detail: I’m looking for mathematical theories that deal with describing formal languages (set of strings) in general and not just grammar hierarchies. Asked By : mtanti Answered By : Raphael There are plenty of possibilities. Others have already mentioned automata which offer Read More …
Problem Detail: I’m reading about the Hindley-Milner typing algorithm while writing an implementation, and see that, as long as every variable is bound, you’ll always get either atomic types or types where the arguments will determine the final type, such as Read More …
Problem Detail: I’m studying binomial heaps. A book tells me that insertion of a node to a binomial heap take $Theta(log n)$ time. So given an array of $n$ elements it would take $Theta(n log n)$ time to convert it to Read More …
Problem Detail: In my program, it draws them by offsetting every other row by half of the width, as pictured above. Each tile can be referenced by coordinates, also shown above. I want to know how many blue tiles are Read More …
Problem Detail: I am trying to find the maximum palindrome sub-sequence and after going through some tutorials, I came up with a memoized version.But I am not sure about the runtime.I want to know if the following algorithm will work.Could also Read More …
Problem Detail: Persistent data structures are immutable data structures. Operations on them return a new “copy” of the data structure, but altered by the operation; the old data structure remains unchanged though. Efficiency is generally accomplished by sharing some of the Read More …
Problem Detail: I designed a simulated annealing-based optimization algorithm. My simulation shows that it converge fast. I am looking for some sort of proof to show that simulation annealing-based algorithm converge fast (based on satisfying some properties) to global/local optimal point Read More …
Problem Detail: Wikipedia says: fun factorial n = if n = 0 then 1 else n * factorial (n-1) A Standard ML compiler is required to infer the static type int -> int of this function without user-supplied type annotations. I.e., Read More …
