Category: Uncategorized

Problem Detail: I’m trying to understand the equivalence in expressive power of formal grammars whose rules take the form: $$ alpha rightarrow beta $$ where $ |alpha| leq |beta| $ (called a monotonic grammar), and grammars whose rules take the form: Read More …

Problem Detail: I’ve been studying for an exam I have tomorrow, and I was looking through some previous sample exam questions, when I came across this problem: Give a non-regular language $L$ such that $L cup L^R$ is regular. I’ve been Read More …

Problem Detail: this is my first question on this site. I‌ recently, study on NP. I have some confusion about this Topic, and want to propose my inference and some one verify me. I) each NP problem can be solved in Read More …

Problem Detail: I asked this question in SO here I have about 1000 sets of size <=5 containing numbers 1 to 100. {1}, {4}, {1,3}, {3,5,6}, {4,5,6,7}, {5,25,42,67,100} … Is it possible to find a set of size 20 that contains Read More …

Problem Detail: What does the notation co- mean when prefixing co-NP, co-RE (recursively enumerable), or co-CE (computably enumerable) ? Asked By : Vanwaril Answered By : Gilles Often, in mathematical terminology, the prefix co- refers to a dual in some sense. For complexity Read More …

Problem Detail:  A) Solve this recurrence where $T(0)=0$ and write it in O-notation: $T(n)= {2 over n} (T(0)+T(1)+…+T(n-1))+c$ So, I started to calculate: $T(1)=2(0)+c=c$ $T(2)=1(0+c)+c=2c$ and so on, which gives me that $T(n)=nc$ This I can prove by induction: $(n-1) Read More …

Problem Detail: I am trying to understand the concept of logical to physical addressing. I am given 72 physical addresses (0-71) with values A virtual address = 2^(p+w) p = page bits w = word bits I know the page table Read More …

Problem Detail: Sorry if this question is either obvious or ignorant. I am a high school student with only the computer science knowledge I have taught myself. Calculators have a function that can convert numbers from decimal to fractional equivalents. For Read More …

Problem Detail: It seems to me that any problem whose solution requires finite memory can be emulated on a Finite State Machine . This would make those problems that can’t be solved by a Finite State Machine to require infinite memory Read More …

Problem Detail: The questions is to find the running time $T(n)$ of the following function: $$T(n)=3cdot T(n/2) + n tag{1}$$ I know how to solve it using Master theorem for Divide and Conquer but I am trying to solve it by Read More …