Author: ignougroup

Problem Detail: Let $T$ be a Turing machine whose accepted language is $L(T)$. Let $X$ be another language. How do you approach a proof like $L(T)subseteq X?$ Asked By : And Answered By : Hendrik Jan In order to prove that any machine, Read More …

Problem Detail: I asked a (seed) question about sums of Landau terms before, trying to gauge the dangers of abusing asymptotics notation in arithmetics, with mixed success. Now, over here our recurrence guru JeffE does essentially this: $qquad displaystyle sum_{i=1}^n Thetaleft(frac{1}{i}right) Read More …

Problem Detail: Consider the following grammar with starting symbol of $S$. $$S rightarrow 0S11;|;S1;|;0$$ Let $L = {0^i1^j:; ge 1; and; j ge2i-2}$ . Give a formal proof of the following claim : For all $n;ge0$, every string of length $n$ Read More …

Problem Detail: is there any difference between transition systems and finite automata? Is it that transition systems consist of both NFA (nondeterministic finite automata) and DFA (deterministic finite automata)? Asked By : ishaarora95 Answered By : Luke Mathieson Yes, did you try wikipedia? Read More …

Problem Detail: I am trying to solve this problem, and i have tried multiple methods, but i must be missing something, here is the problem: Given a matrix MxN. Find the shortest path from (1,1) to (M,N), where each number in Read More …

Problem Detail: For a rational number 1/3 below is the floating point representation(64 bit) of decimal expansion 0.3333333…. As per the above bit structure, I would like to interpret the value of exponent(11 bits) and value of fraction(52 bits). exponent has Read More …

Problem Detail: Suppose we define an operation such that $$A text{ avoiding } B = {w in A mid wtext{ has no substring in }B},.$$ How can I prove that, if $A$ and $B$ are regular then $Atext{ avoiding }B$ is Read More …

Problem Detail: Let’s say OS is using preemptive CPU scheduling. A process P1 gets a chance to run for some time and then next higher priority process comes and preempts P1. After that higher priority processes are coming regularly and P1 Read More …

Problem Detail: A machine has 48-bit virtual addresses and 32-bit physical addresses. Pages are 8K. How many entries are needed for a conventional page table ? The answer is 2^35 entries Why not (2^32) / (2^13) = 2^19 entries…? My doubt Read More …

Problem Detail: I’m doing an exercise from my book that says: Let $r$ and $s$ be arbitrary regular expressions over the alphabet $Sigma$. Find a simpler equivalent regular expression: a. $r(r^*r + r^*) + r^*$ b. $(r + Lambda)^*$ c. $(r Read More …