Author: ignougroup

Problem Detail: Is the language $L = { a^ib^j mid i nmid j } $ context free ? If we fix $n in N$ then we know that the language $L = { a^ib^j mid forall 1 le k le n Read More …

Problem Detail: I am using a digital computer to write this message. Such a machine has a property which, if you think about it, is actually quite remarkable: It is one machine which, if programmed appropriately, can perform any possible computation. Read More …

Problem Detail: The algorithm that is used by gcc and llvm is that of Keith D. Cooper, Timothy J. Harvey, and Ken Kennedy (page 9). We start with the immediate dominators of each control-flow graph node B already calculated and stored Read More …

Problem Detail: I would like an example of a quine in pure lambda calculus. I was quite surprised that I couldn’t find one by googling. The quine page lists quines for many “real” languages, but not for lambda calculus. Of course, Read More …

Problem Detail: Wiki define Polynomial time as fallow: An algorithm is said to be of polynomial time if its running time is upper bounded by a polynomial expression in the size of the input for the algorithm, i.e., $T(n) = O(n^k)$ Read More …

Problem Detail: In class our professor showed us 3 methods for proving non-regularity: Myhill–Nerode theorem Pumping Lemma for regular languages Proof of non-regularity, based on the Kolmogorov complexity Now the first two, Myhill-Nerode theorem and Pumping lemma, I understood well and Read More …

Problem Detail: I was trying to look my book computer architecture and design, but I can not find the answer for this question. what are-the key-advantages of pipelining? Asked By : Aida Answered By : Illimitable I Googled your question and found this Read More …

Problem Detail: Does it make sense for a Turing machine to have infinite number of states ? I had previously asked a question Can Turing machines have infinite length input. From which I came to know about Type-2 Turing machines. If Read More …

Problem Detail: There are $n$ students and $m$ courses. Each student $i$ wants to attend a subset $C_i subseteq {1,ldots,m}$ of the courses. There are $k$ time slots on a weekly schedule. The goal is to select a time slot for Read More …

Problem Detail: I understand that a pipe is a form of IPC where a process creates a link to communicate with some other process (a child maybe), taking each one a end of the pipe. File descriptors are created for read Read More …