Author: ignougroup

Problem Detail: I’m looking for examples of loops that have running time $O(nm)$, $O(n+m)$ and $O(nlog m)$ to help me understand these concepts. Could anybody give some examples and explain why they have the given running time? Asked By : om471987 Answered Read More …

Problem Detail: I’m studying about Local Binary Pattern and I’m having trouble understanding the following part about the number of output labels for binary patterns from Computer Vision using Local Binary Patterns, by Pietikäinen et al. (2011): Another extension to the Read More …

Problem Detail: Most of us know the correspondence between combinatory logic and lambda calculus. But I’ve never seen (maybe I haven’t looked deep enough) the equivalent of “typed combinators”, corresponding to the simply typed lambda calculus. Does such thing exist? Where Read More …

Problem Detail: I am reducing a given Turing Machine to the complement of the known undecidable problem, $$ Complement(A_{TM}) = { langle M,w rangle mid M text{ is TM}, w notin L(M) }$$ To this Turing Machine, known as SPARSE TM: Read More …

Problem Detail: In programming languages, closures are a popular and often desired feature. Wikipedia says (emphasis mine): In computer science, a closure (…) is a function together with a referencing environment for the non-local variables of that function. A closure allows Read More …

Problem Detail: I am having trouble getting my head wrapped around epsilon transitions while creating an LALR(1) parse table. Here’s a grammar that recognizes any number of ‘a’ followed by a ‘b’. ‘S’ is an artificial start state. ‘$’ is an Read More …

Problem Detail: Lets say I have given following grammar which generates arithmetic expressions in reverse polish notation: $G=({E},{a,+,*},P,E)$ $P={ E rightarrow EE+ | EE* | a }$ I know this grammar is unambiguous. What I do not understand is how I Read More …

Problem Detail: Consider the following variation (let us call it Q) on the Vertex Cover problem: Given a Graph G and a number K, we are asked if there is a k-cover of G so that it is the minimum cover. Read More …

Problem Detail: How would I go about making a Turing machine to accept the following language L? $$L = { www mid w = {0,1}^* text{ and } w > 0}$$ I was thinking counting the number of symbols in the Read More …

Problem Detail: In the article [“Triangulating Planar Graphs While Minimizing the Maximum Degree”] by Kant and Bodlaender [1], Section 4 briefly mentions the extraction of elementary cycles (no repeating edges) from what I assume is an undirected graph $H$. It has the following Read More …