Author: ignougroup

Problem Detail: When describing the syntax of a given programming language the words “expression” and “term” are often used to seemingly describe the same things. Are these words interchangeable in the context of programming languages? Asked By : tibbe Answered By : Gilles Read More …

Problem Detail: Is there a good general paper about the interpretation or compilation of REGEXP in programming languages for pattern matching, with or without variables? I am not looking for a quick explanation about the construction of DFAs, but for a Read More …

Problem Detail:  i=n; while(i>0) { k=1; for(j=1;j<=n:j+=k) k++; i=i/2; } The while loop has the complexity of $lg(n)$ the j value of inner loop runs 1,3,6,10,15… increase like 2,3,4,5,… But how to find the overall complexity ? Asked By : Xax Read More …

Problem Detail: I’m starting an undergraduate computer science course next fall, but I can’t really understand λ-calculus in the context of functional programming. I may be misinterpreting this completely, but based on this definition from the Stanford Encyclopedia of Philosophy, it’s Read More …

Problem Detail: I have pretty simple question, but still can’t find an answer just googling it. I’m trying to understand Chomsky Normal Form (CNF). There are three production rules: $A to BC$ $A to alpha$ $S to epsilon$ First two I Read More …

Problem Detail: Quoting Online algorithm from Wikipedia: In computer science, an online algorithm[1] is one that can process its input piece-by-piece in a serial fashion, i.e., in the order that the input is fed to the algorithm, without having the entire Read More …

Problem Detail: $NP = cup_{k in mathbb{N}} NTIME(n^k)$ $P = cup_{k in mathbb{N}} TIME(n^k)$ Can we show that $NTIME(n^k) = TIME(n^k)$ for a specific $k$? For how large of a $k$ can we show the above statement to be true? Asked Read More …

Problem Detail: I was searching for interesting and easy to state open problems in computability (understandable by undergraduate students taking their first course in computability) to give examples of open problems (and obviously I want the students to be able to Read More …

Problem Detail: Is the grammar $qquad S to 1A0A mid 0A mid varepsilon$ a right-linear grammar? $A$ is a nonterminal here, $0$ and $1$ are terminals. I know $0A$ is right-linear but what about $1A0A$? Trying to construct a right-linear grammar Read More …

Problem Detail: While solving some question, that involved the empty set $emptyset$, I was really wondering, is $emptyset$ reducible to any other language, i.e., $emptyset leq A$ such that $A$ is a language over a given alphabet $Sigma^*$? I mean, one Read More …