Blog

Problem Detail: I have a deterministic finite automaton which behaves mostly like a Turing machine, with following difference (relevant to this question): The tape is initially finite. The automaton can insert and delete cells from the tape. Actions are associated with Read More …

Problem Detail: Background: Some people consider Software Engineering as a branch of Computer Science, while others consider that they are, or should be, separate. The former stance seems to be well presented in written works. On Wikipedia, Software Engineering is classified Read More …

Problem Detail: I know that the complexity class $mathsf{P}$ has complete problems w.r.t. $mathsf{NC}$ and $mathsf{L}$ reductions. Are these two classes the only possible classes of reductions under which $mathsf{P}$ has complete problems? Also, what classes of reduction can be used Read More …

Problem Detail: $S rightarrow S$, $L(G) = {}$ LL(1) analysis: We estabilish $FIRST(S)$ to be empty and $FOLLOW(S)$ to be ${$}$. $FIRST(S)$ doesn’t contain ε, so the parse table looks like this: +—+—+ | | $ | +—+—+ | S | Read More …

Problem Detail: A YouTube video I was watching explained the differences between Imperative and Functional programming by demonstrating how the numbers from 1 to 10 are summed up in Java and in Haskell respectively. In Java, you must explicitly state each Read More …

Problem Detail: I am looking for implementation of the set data type. That is, we have to maintain a dynamic subset $S$ (of size $n$) from the universe $U = {0, 1, 2, 3, dots , u – 1}$ of size Read More …